DS & Algorithms
Last updated on 2026-02-01 (history).
## Things to study
- Time and space complexity analysis.
- Dynamic programming.
- Binary search.
- Binary search on answers.
- 2 pointers.
- 2 pass technique.
- Sorting - merge sort, quick sort.
- Graphs - Dijkstra, A*.
- Sliding window.
- Priority queue.
- Intervals.
- Trees - red black tree, AVL tree.
- Math - discrete math, combinatorics, nCr, probability.
## Some theory
- P vs NP.
- OS - locks, mutex, semaphores, monitors, deadlock.