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,122 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.
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)
Viewing 451 - 460 interview questions