CSES Problem Set

Currently Playing: CSES Speedrun - Graphs - Part VIII

This is part 8 of me doing problems from the CSES problem set dealing with graphs, and the final part of the graph section. This one is all about network flow: max flow via Dinic's algorithm. Problem Set: https://cses.fi/problemset/ 0:00 Intro 0:17 Download Speed (Dinic's max flow: level graph + blocking flow DFS) 32:22 Police Chase (min cut via max flow + residual reachability) 45:29 School Dance (bipartite matching via max flow) 55:21 Distinct Routes (edge-disjoint paths + path reconstruction) 1:09:48 Wrap-up 🚀 Book a Mock Interview with me: https://calendly.com/anatoliy-sokolov 💬 Join the Discord Community: https://discord.gg/ufpdqkSupH #softwareengineering #codinginterview #leetcode #faang