Intermediate · Coding interviews: heaps, recursion and intervals
Recursion
Six interview problems solved from smaller cases of themselves: a symbol deep in a table of rows, Fibonacci numbers by halving, the last one left in a circle, prefix expressions, a list's inversions counted by merge sort, and the closest pair of points.
- You build
- symbols.py, then fibonacci.py, then circle.py, then expressions.py, then inversions.py, then closest.py
- Stages
- 6 Problems
- Time
- About 2.5 hours
Loading the workspace…
Loading the workspace…