Given a 2D array, find the sum of all the elements in the array. O(n^2) solution is too slow, find ways to optimize (ended up adding a second parameter 2D array).
Development Engineer Interview Questions
37,118 development engineer interview questions shared by candidates
Heap Sorting. What data structure do you use to implement it? Time to access and sort. Code it.
Is it possible to sort using linear time a file with lots of numbers that contain duplicates, when there are no limits of resources or space?
About the details, and interviewer will communicate with you when you are typing.
Find top k largest numbers in array in O(n) time
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.
How to come out of a maze given that you can move one step at a time and you cannot turn left.
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.
Find the next node in a binary tree from any node (implying successor to a node)
Viewing 451 - 460 interview questions