Rod Cutting Problem: Maximum Revenue DP
You have a steel rod of length n inches. Your supplier buys rod pieces at different prices depending on their length. The question: how should you cut the rod to maximize revenue?
Read more →Maximum
Maximum Subarray Sum: Kadane's Algorithm
Given an array of integers, find the contiguous subarray with the largest sum. That’s it. Simple to state, but the naive solution is painfully slow.
Read more →Hopcroft-Karp Algorithm: Maximum Bipartite Matching
A bipartite graph consists of two disjoint vertex sets where edges only connect vertices from different sets. Think of it as two groups—employees and tasks, students and projects, or users and…
Read more →Ford-Fulkerson Algorithm: Maximum Flow
Network flow problems model how resources move through systems with limited capacity. Think of water pipes, internet bandwidth, highway traffic, or supply chain logistics. Each connection has a…
Read more →Dinic's Algorithm: Efficient Maximum Flow
Maximum flow problems appear everywhere in computing, often disguised as something else entirely. When you’re routing packets through a network, you’re solving a flow problem. When you’re matching…
Read more →