Find top k largest numbers in array in O(n) time
Development Interview Questions
137,370 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
Given a balance and marbles where one marble weighs more than the other, how many times do you have to use the balance to find the heaviest marble for 7 marbles. Then, extend that answer to how many marbles can you weigh with 4 tries.
Remove all characters of a string from another string. The algorithm should be less than O(m*n) where m & n are lengths of strings and the space used should be less than O(m+n).
based on user input, return an updating list of us cities as the user types. example: user input = s return= san fran, san antonio, seattle.... user input = e return = seattle, seguela, sebba... and so on
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)
Viewing 651 - 660 interview questions