Implement algorithms and data structures

Select optimal data structures and prove algorithm complexity bounds

Solving programming interview problems and building efficient systems without trial-and-error.

• · Problem spec (query/insert/delete frequencies), size bounds, precision needs

• · Data structure choice, implementation, worst/average case Big-O proofs

• · Understand Big-O notation
• · Know sorting, searching, graph traversals

• · Picking hash map when order matters (use B-tree)
• · Ignoring cache locality (array faster than linked list)

• · Tibsfox, stable 2026-04-12
• · Covers heap, trie, segment tree, DSU, fenwick tree