(following the previous one) You got only TWO baby bottle sample. You would like to know the max height you can drop it without breaking the bottle. Let set the unit as 1 foot. And the highest height you can reach is at N feet. So how would you find the (max) safe height? (This is the one I think is kind of brain-teaser one.)
Given the head pointers to two linked lists of unknown length, find the node of intersection if they do intersect.
Make a program that writes a Binary Search Tree to a file. Now create a program that reads those files and recreates a Binary Search Tree.
Signed an NDA, so I will not post the questions.
I signed NDA for online assessments. For the phone interview, questions about DS and string manipulation. Should be good if can solve medium level HackerRank or Leetcode problems.
Implementing a dictionary of quick searching words
Can you think of an example of a scenario where you would want to use a tree with more degrees of branching than a binary tree?
Given a list of n elements...every element has a duplicate except one...Find that lone number?
string compression: aaabbbbcc ->a3b4c2
Given a set of points (x,y) and an integer "n", return n number of points which are close to the origin
Viewing 11 - 20 interview questions