Advanced Data Structures & Algorithms test (Advanced)
40 questions · 40 minutes · Free
What it covers
- Advanced dynamic programming
- Shortest paths and minimum spanning trees
- Segment trees and Fenwick trees
- Tries and string algorithms
- Greedy proofs and backtracking