Skip to content
Ephizen logo ephizen / wiki
§ cs 301 · 14 guides

CS 301 — Algorithms

Binary search, sorting, recursion, DP, greedy, backtracking, graph algorithms — the named algorithms that solve named problems.

Level
14 guides
# Code Name Level Updated
1 —
Backtracking Systematic search through choice trees — subsets, permutations, N-queens, sudoku.
intermediate
2 —
Binary Search Halve the search space each step — including the search-on-answer template.
intermediate
3 —
Bit Manipulation XOR tricks, bitmasks, and bit-counting — single-number, subsets, and bitmask DP.
intermediate
4 —
Cyclic Sort In-place sort for arrays containing 1..n — O(n) time, O(1) space, finds duplicates and missing numbers.
beginner
5 —
Dijkstra Shortest path in weighted graphs with non-negative edges using a min-heap.
advanced
6 —
DP — 1D One-dimensional dynamic programming — Fibonacci, climb-stairs, house robber, decode.
intermediate
7 —
DP — Grid & Strings Two-dimensional DP — LCS, edit distance, unique paths, longest palindromic subsequence.
advanced
8 —
DP — Knapsack 0/1 and unbounded knapsack templates — the answer to most "pick items with limit" problems.
advanced
9 —
Graph BFS Shortest path in unweighted graphs and shortest-step grid problems.
intermediate
10 —
Graph DFS Connected components, cycle detection, and exhaustive search on graphs.
intermediate
11 —
Greedy Take the locally optimal choice — when it works, it beats DP on speed and memory.
intermediate
12 —
K-Way Merge Merge K sorted sequences in O(N log K) using a heap of cursors.
intermediate
13 —
Topological Sort Kahn's algorithm and DFS variants for ordering DAGs — build systems, course prereqs.
intermediate
14 —
Union-Find (DSU) Near-O(1) connectivity queries with path compression and union by rank.
intermediate