Given a binary tree, where each node has a third reference which is not yet initialized, go through the tree and point the third reference to the rightmost tree node on the same level. If there are no other nodes to its right, point it to null.
Intern Interview Questions
249,753 intern interview questions shared by candidates
Given a sorted array, write a function that will create a binary search tree from the array.
design an algorithm to find every word in a 4*4 box (like words with friends)
how do you overcome a problem with a coworker?
Tell me something about yourself
Tell me about yourself. How to solve a difficult situation?
implement atoi
If a sorted array is rotated, how to find how many times it has been rotated.
Write a function to construct a binary search tree given a string in postorder notation ("abcdefg").
Find the sublist with the greatest sum in linear time
Viewing 821 - 830 interview questions