The interviewer confused me like hell when describing the question. Every node of the tree has a pointer to its left most child. each node has a pointer to its next sibling. Its a BST. Find the smallest value in the tree.
Test Development Engineer Interview Questions
5,598 test development engineer interview questions shared by candidates
Implement a Find-Replace function given a string of text, search string, and replace string. Also a seemingly simple question became very difficult and complex when looked at through the eyes of a tester. A question involved writting a function to classify a triangle given its side lengths.
Write a function that determines whether a given number is a prime. Discuss perf improvements.
Reserve link listed pair-wise
Reverse the individual words in a string (words are delimited by spaces). Example - "Hello world" becomes "olleH dlrow".
Shuffle Linked List
Given the root of a binary search tree, link all the nodes at the same level, by using an additional Node* level.
How can you write a recursive function calculating the exponential of a number?
All sorts of brain teasers (monte hall problem, etc)
How to insert a Node in a Linked list.
Viewing 121 - 130 interview questions