Find top k largest numbers in array in O(n) time
Development Interview Questions
137,253 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.
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
62-63=1; Changing only one element (either digit or operand), make this statement true.
Find the next node in a binary tree from any node (implying successor to a node)
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).
you have 100 doors in a row that are all initially closed. you make 100 passes by the doors starting with the first door every time. the first time through you visit every door and toggle the door (if the door is closed, you open it, if its open, you close it). the second time you only visit every 2nd door (door #2, #4, #6). the third time, every 3rd door (door #3, #6, #9), etc, until you only visit the 100th door.
A rotated sorted array (e.g. 34512), find the rotation count (in this case, 3 means rotated by 3).
Viewing 661 - 670 interview questions