Algorithm question was how to find the lowest common ancestor for a binary tree. Then find a solution that is linear for space complexity.
Developer Interview Questions
271,141 developer interview questions shared by candidates
Find the intersection between 2 NSRanges
Given a 2D array you are allowed to traverse Right or Down. print all possible paths from 0,0 to m,n by traversing either right or down.
How to multiply a number by 7 without using + and * operators?
Can you explain the 5 basic principals for object oriented programming?
Did you ever take any decision against the team and did you succeed?
2 stacks are given, one is full of numbers and other in empty, one integer variable is given, fill the 2nd stack with numbers in ascending order with space and time constraints.
Given a mutable string (array of characters) of words, how would you reverse the order of the words in the string, not the entire string. This must be done in place, i.e. not using any additional memory. eg) "Hello World" => "olleH dlroW"
3) Given a N*N array where N is even such as 4, 8 and so on . Print the array from the center. a= [1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16] the output should be [6 10 12 7 3 2 1 5 9 13 14 15 16 12 8 4 ] .
Sequence of robot moves and find circular loops in given moves sequence. sequence = "<<>>>>^v^v>><<" , < WEST, > EAST, ^ NORTH, v SOUTH. ^v this is a circular loop. find all such loops in a moves sequence.
Viewing 891 - 900 interview questions