Telephone interview: Find largest integer from an array of integers. The integers in the array are arranged in strictly increasing (no 2 integers are same) or strictly increasing then decreasing; so like a curve and you have to find the peak. Discuss time complexity. Write code.
Return k smallest element in a tree
given rand5() that return 1-5 uniformly produce rand7() that returns 1-7 uniformly
Explain this: var Bob = { name: "Bob", name_fn: function(){ return this.name; } } console.log(Bob.name_fn()) //"Bob" var fn = Bob.name_fn console.log(fn()) //undefined
given list[list[String], where each list[String] represents a node in the following manner: node.id -> child0.id -> child1.id -> ... rebuild the tree.
Write a pgm to find out if call stack address is increasing or decreasing
First phone screen: Print all the nodes of a tree in reverse level order (ie print all the nodes at the leaves first, then print the nodes on the level above the leaves, and then eventually work your way to the top).
write a wrapper fun for 32-byte aligned mem allocation
Write a function to calculate build order given a project with a list of dependencies that also need to be built
Display the first 3 character of a word(string)
Viewing 1 - 10 interview questions