I can't go into details about the problems. But I wish I had studied my graph algorithms a little more closely. Make sure you know your big-O algorithm classifications. Almost every interviewer asked me something to do with that.
Software Engineer Data Interview Questions
439,223 software engineer data interview questions shared by candidates
Write a code that returns the deepest node in a binary tree. If the tree is complete, having two same depth of node, return the rightmost node.
Determine whether 4 elements in an array sum to 0 in O(n^2) time.
How many ways can an ant travel through all of the corners of a cube? Constraints were that each corner cannot be visited twice. How many ways can an ant start at a corner move through all adjacent corners and return to starting position?
- Given a real-time list of traded stocks, need to get the last N (arbitrary) unique traded stocks. Write addTrade(string ticker) and getLastNUnique(int n) functions with efficient runtime.
find min of array that decrease then increase, like [5,4,3,2,1,2,3,4,5]
Say that you have an infinite amount of sorted data coming in, implement a way to find a specific time stamp.
Find the height of a tree, and then find the longest path in a tree.
You have 12 marbles, out of which only one is of different weight. You dont know if its less or more than the others. what is the lest number of weighings you have to make to find it.
Implement a class called AirMap that has two methods: 1. add_route(start, destination) - adds ONE WAY connecting flight from one airport to another 2. print_all_routes(start, destination) - prints all possible routes from start to destination Given the following routes, print all possible routes between the airport C and D: A -----> B B -----> A A -----> C C -----> A A -----> D D -----> A B -----> C C -----> B B -----> D D -----> B Expected Output: C,A,B,D C,A,D C,B,A,D C,B,D
Viewing 1701 - 1710 interview questions