In this section, I'll teach you how to solve bipartite matching problems. These appear when you have two groups (like people and schools, workers and jobs) where each member of one group can connect to specific members of the other group. You will learn Kuhn's algorithm to find maximum matchings, see how this connects to max flow, and work through problems like CSES School Dance.
By the end, you will know when a perfect matching exists and how to compute it fast.
