Here is the brain teaser question: Given integers as 1, 2, 3, 4, ..., N. Every time you remove an alternative element until only one is left. If you reach the end, just do a rounding. Return the remaining element. For example, given 1,2,3,4,5,6, you remove 1, 3, 5 and then 2, 6. So the remaining element is 4. What is the remaining element if N is 2000?
Given a Binary Search Tree with integers at every node and an integer k, write code that decides whether or not there exists two nodes a and b such that a+b=k
The tech questions were easy if you had some practices (leetcode, etc). The behavior questions did catch me. Be prepared for some real QA scenario questions!
Write numbers 2^1000 and 5^1000 in a decimal notation, next to each other. How many digits does the newly obtained number have?
The database all of a sudden becomes very slow, what could be the cause of this?
An online retailer allows sellers to post different prices for the same product at different time intervals. Find an algorithm to return a list of sorted intervals with the lowest price.
Difficult Quantitative questions
Convert a string to an integer
How can you satisfy egos of incompetent interviews?
Given a BST with leaf nodes having a numeric value, and nodes having the sum of values of its two children. Find an algorithm to find the maximum node within a tree.
Viewing 461 - 470 interview questions