Find top k largest numbers in array in O(n) time
Development Interview Questions
137,413 development interview questions shared by candidates
To find least common ancestor in a binary search tree
Q: Implement one part of a three-part problem - have a general idea of important algorithms and know how to use data structures! Work efficiently and start off getting something brute force and simple working, and then optimize later.
62-63=1; Changing only one element (either digit or operand), make this statement true.
Sell 1 Pen for Rs. 1 Lakh where the customer doesn't have the need and their monthly salary is Rs. 5 Thousand
Find the middle point of a linked list in best possible way
Find the next node in a binary tree from any node (implying successor to a node)
How to come out of a maze given that you can move one step at a time and you cannot turn left.
You have a building with 100 stories. You also have two glass balls. You can drop the glass balls as many times as you want before they break. How can you find the floor at which they start breaking with the fewest number of drops?
How many windows APIs do you remember?
Viewing 661 - 670 interview questions