Extremely simple questions. First-round had a question like, given an object array, combine objects with one more matching fields and return the resulting array. The second round was behavioural and one question on removing trailing spaces. They don't ask any in-depth technical quesions.
Find the optimal map route between two points on a grid (maze) with some areas blocked out.
Given a list L of n numbers. Write a function to return true if the sum of any two numbers of L equals to k; false otherwise.
Serialize and deserialize a collection of strings into a single one.
reverse a sentence such that the ordering of words is reversed but the words aren't changed
Get the two highest number in a binary search tree
I spent much time for answering a question. Q : In a grid, if points, which refer locations of people, are given, which point in the grid will be the best point to meet together that the sum of distances from each position to the point is shortest. Distance between two points p1 and p2 is |p1_x-p2_x| + |p1_y-p2_y|.
A array : 1 3 0 2 4 9 input: dest-node: A0 output: all the source nodes: (A1, A3, A4) Each element in this array means the steps it can take. Each element can go left or right. So A[1] and A[4] can reach A[0]. A[1] can reach A[4], A[4] can reach A[0], so A[1] can reach A[0]. Output the index of element which can reach A[0].
Given a set of shapes in 2D space, and a coordinate pair, write a routine that returns true if any of the shapes overlap the coordinate pair.
Write a program to find depth of binary search tree without using recursion
Viewing 1871 - 1880 interview questions