>RunTimeFix
BookStudyPracticeInterviewsYouTubeCoursesAbout
Log inGet Started
Practice/Network Flow & Matching
2 subtopics · 6 problems

Network Flow & Matching

Max flow / min cut, bipartite matching, and min cost max flow.

01Maximum Flow / Min Cut

Ford-Fulkerson, Dinic's algorithm — find max flow in a network.

3 hard
ProblemDifficultyLink
653DDelivery BearshardSolve
546ESoldier and TravelinghardSolve
653EBear and Forgotten Tree 2hardSolve

02Bipartite Matching

Maximum matching in bipartite graphs (Kuhn's / Hopcroft-Karp).

2 medium1 hard
ProblemDifficultyLink
427CCheckpostsmediumSolve
1144FGraph Without Long Directed PathsmediumSolve
1066FYet Another 2D WalkinghardSolve
All TopicsStudy the Theory
Was this helpful?
>RunTimeFix

Practical programming education. Books, videos, courses, and hands-on learning for competitive programming, DSA, and software engineering.

RunTimeFix

  • About
  • YouTube
  • Book
  • Study Library
  • Courses

Learn

  • Competitive Programming
  • DSA
  • Development
  • Databases

Legal

  • Privacy
  • Terms
  • Refund Policy

RunTimeFix — debug → solve → run

© 2026 RunTimeFix. All rights reserved.