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|.
Given a maze, represented as a matrix, and the initial and final points write an algorithm to solve this.
Write a function to find intersection of 2 sorted arrays.
Try to figure out the top unique search queries from a database with 100 billion entries
Write a program to find depth of binary search tree without using recursion
Writing the code to convert numeric amount of price into English words.
How would you sort a file which is too large to fit in memory.
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.
Round 1 Given a bitmap, use a quaTree data structure to represent the bitmap. The maps are all squares with black or white pixels and the length of the map is 2^n (you can always divide the map into 4 smaller parts). Then give you a root node of a quaTree, calculate the total black pixel in this map. Follow up: Given two root node, generate the intersection of these two maps.
Viewing 1861 - 1870 interview questions