Was asked a very interesting tree problem.Given a tree and a number N, construct another tree such that each node of the tree has either 0 or N elements,except for one node which has between 0 to N elements.Only other constraint is that ancestry is preserved in the new tree.
Given a race track with 5 lanes, 25 bunnies, and no timer, how many races are required to find the top 3 fastest bunnies?
find a missing element in array B compare to array A.
1) Valid Parentheses 2) sorting an array based on the sequence of another array I cannot remember other questions.
Design a distributed system for delivering messages to a main control.
They will ask you about your previous experience and basis questions
Design a data structure to store sparse 2D matrix which contains only 0 or 1. then write function to add 2 such matrix.
nothing that i can recall
Implement a promise to fetch the graph data.
Create a low pass filter using inductor and resistor?
Viewing 731 - 740 interview questions