- Given a binary tree and a number, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals the given number. Return false if no such path can be found. - How do u know if a number is divisible by 8? (hinted to use a binary operator and NOT % or the subtraction approach)
Q. Remove duplicates from an sorted array inplace. He was expecting a linear time solution for this.
How to monitor web service?
What was the thing you do not like in the the project you like best?
It was simply unexpected, why do you use Java?
What makes you a good candidate for this position?
Mainly algorithmic and design questions
3 coding problem in hackerrank all of them are form basic algorithm. first was find the number containing max frequency and its frequency. second was given the max number of swaps create greatest after performing the given number of swaps.
Implement a Stack. (of ints; push, pop, peek) Implement a method that returns the smallest integer in the stack. (min) Implement a method that returns the statistical mode of the stack. (mode) O(1) time for all.
Find if two values in an array add to a third given value.
Viewing 3161 - 3170 interview questions