Data Structures and Algorithms

Binary search: BS can be used in so many different situations!
Leap year, GCD, LCM, isPrime, prime finding, prime factorization
Bit manipulation
Reservoir sampling
2 pointer strategy and sliding window
cumulative sum, prefix sum (1d, 2d, 3d)
Sorting: selection sort, quick sort, quick select, insertion sort (with binary search optimization), merge sort, heap sort, radix sort, counting sort, bucket sort
String strategies: rabin-karp, KMP, Boyer-Moore
Graph: Dijkstra, Bellman-Ford, Union find, Kruskal, Prim, Floyd-Warshall, Tarjan, DFS, BFS, Ford Fulkerson & Edmond (Min cut max flow), Hamiltonion path (with bitmasking), Eulerian cycle, Topological sorting
DFS: backtracking
Monotonically increasing stack, queue, etc.
DP: Top-down using recursion and memoization, Bottom up using iteration and tabulation
Classic DP patterns: LCS, LIS, LIS (strictly increasing), Equal sum partition
BIT: binary indexed tree/sedgwick tree
Interval trees
Tree: inorder, preorder, postorder traversal: iterative and recursive, morris traversal to do those 3 in O(1) space
Binary search trees (BSTs), heaps, splay trees, red-black trees, skip list, avl tree

Data structures in 5 min:

SubPages