
What Is Bipartite Matching? The Assignment Problem, Explained
Bipartite matching finds the maximum pairing in a two-group graph. Learn augmenting paths, Kuhn's algorithm, and when this shows up in interviews.
Page 14 of 61 · Ideas for curious minds in tech.
Back to the archive
Bipartite matching finds the maximum pairing in a two-group graph. Learn augmenting paths, Kuhn's algorithm, and when this shows up in interviews.

The max flow min cut theorem: proof, Edmonds-Karp algorithm, complexity analysis, and implementations in 14 languages for coding interviews.

The hamiltonian path problem asks you to visit every vertex exactly once. It's NP-complete, and disguises itself in coding interviews as small-constraint grid puzzles.

An Eulerian path visits every edge exactly once. Learn the degree condition, Hierholzer's algorithm, and how this graph concept appears in coding interviews.

A bridge in a graph is an edge whose removal disconnects the graph. Learn Tarjan's O(V+E) algorithm to find every bridge in one DFS pass.

Articulation points in graphs explained: Tarjan's O(V+E) DFS, discovery time, low values, the root exception, and three common interview mistakes.

Level order traversal explained: the queue trick, level-size snapshot, 7 LeetCode patterns, and implementations in Python, Java, C++, Go, and 10 more.

Preorder, inorder, and postorder traversal explained with traces, code, and a guide to which order wins for any binary tree interview problem.

Overlapping subproblems are why naive Fibonacci takes minutes at n=50. Learn what the term means, how to spot it, and why it unlocks dynamic programming.
Optimal substructure is the property that makes dynamic programming work. Learn the definition, the cut-and-paste proof, and when the property breaks.

The greedy choice property tells you when local decisions are globally safe. Learn the exchange argument and how to verify it before every interview.

A subarray is a contiguous slice of an array. Learn the definition, how to count them, and the four patterns that solve most interview problems.

Subsequence vs substring: one word changes your algorithm. Learn the key difference, two-pointer vs DP, and the clarifying question that separates candidates.

Anagram coding interview problems reduce to one idea: frequency profiles. Learn the sort, count, and sliding window approaches for LeetCode 242, 49, and 438.

Learn every palindrome interview question pattern: two-pointer check, longest palindromic substring, DP subsequence, and the edge cases that trip candidates.
Learn what randomized algorithms are, why expected O(n log n) beats worst-case sorting, and how Las Vegas vs Monte Carlo algorithms differ for interviews.

The Fisher-Yates shuffle is the only correct way to uniformly shuffle an array. Here's why the naive version is biased and how the fix works.

Reservoir sampling for LeetCode 382 and 398: the single-pass O(n) algorithm, inductive proof, and k=1 implementation for coding interviews.

Fast exponentiation computes x^n in O(log n) steps by squaring. Learn the algorithm, the INT_MIN trap, modular exponentiation, and LeetCode 50.

Matrix exponentiation computes Fibonacci and any linear recurrence in O(k³ log n) by applying binary exponentiation to matrix multiplication.
Learn how the subset sum problem works: the O(2^n) brute force, O(n·T) DP table, the critical backward scan, and how LeetCode 416 and 494 disguise it.

The coin change problem breaks greedy. Learn the DP recurrence, bottom-up solution, common bugs, and why interviewers use it as a DP filter.

Master the 0/1 knapsack problem with DP: recurrence, table fill, space optimization, and the scan direction bug most engineers miss.

Master the longest increasing subsequence algorithm: O(n²) DP table, O(n log n) patience sort, and 14 language implementations for LeetCode 300.