Lesson overview · Free interview practice

Network Flow Algorithms

Solve flow problems in networks, such as maximum flow and minimum cut.

Topics in the full lesson
  • Concept and Use Cases
  • Key Concepts
  • Time and Space Complexity
  • Network Flow Algorithms and Methods
  • Practical Tips and Tricks
  • Common Gotchas
  • Advanced Topics
  • Interview Tips and Tricks
  • Common Mistakes

Practice Problems

Work through a question before revealing its explanation. These questions and answers are free; Premium adds the full lesson walkthrough, examples and implementation detail.

Completion marks record your own progress, not an automatically checked result. The task type does not determine whether it is optional.

CodingHard

Maximum Students Taking Exam

Question

You are given an m × n matrix seats representing a classroom ('#' is a broken seat, '.' is available). A student sitting at (i, j) can see the answers of any student in the four positions (i, j-1), (i, j+1), (i-1, j-1), (i-1, j+1) (no upward sight). Return the maximum number of students that can be seated such that no one can cheat off anyone else.

Take a moment to think about this before revealing the answer

Explain your reasoning or try an implementation before comparing answers.

Practice on LeetCode

Explore the full Network Flow Algorithms material

Premium includes the complete lessons and implementation references. Free practice questions remain available without a subscription.

All course tracks & premium content
From basics to advanced masterclasses
Built for JS/TS developers like you
Real-world tips & common pitfalls
Upgrade to Premium