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.
Write a code that show all possible permutation from a given String.
Only one programming questions. Input a string, including numbers, operands, and brackets. Calculate the result. Test case: input: "(+ 3 3)": Output: 6 input "(* 3 3)" Output: 9 input: "(+ 1 12 (- 17 3) 5 (* 2 8 (/ 120 4)) 46)", Output: 1 + 12 + (17 - 3) + 5 + (2 * 8 * (120 / 4)) + 46 = 558
Find the shortest distance between two points in a 2D grid world (bfs).
Given two identical strings, where one string has a random character inserted, return the random inserted character.
Given an int array A, return an int array B that A[i + B[i]] is the first element in A after A[i] that is greater than or equal to A[i]
Q: List all comments in the given segment of codes.
Standard algorithms and data structures questions.
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.
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.
Viewing 1861 - 1870 interview questions