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.
Softwareentwickler Backend Interview Questions
513,087 softwareentwickler backend interview questions shared by candidates
Given a 8x8 chessboard, write code to calculate the number of ways you can go from the the top left corner to the bottom right corner, given that you can go down, up, left, AND right.
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.
2, 3, 5, 7, what comes next
Implement singleton
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.
Viewing 1931 - 1940 interview questions