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.
Fastest way to find the middle node in a linked list
In java and using math, check if a number is a palindrome.
Asked to write a method were it's passed an array of numbers and a single number. I needed to return true if there was two numbers in the array that if added totaled the single number. I was then asked to rewrite it to make it run faster.
How immediately you can join
Give an example of when you had a angry customer in front of you, and how did handle it?
Make recipe APIs for HelloFresh
How are you?
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.
Viewing 841 - 850 interview questions