#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/pattern-22/graphs-dfs/surrounded-regions-problem-statement

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/pattern-22/graphs-dfs/surrounded-regions-problem-statement

Repovive

LeetCode 130 Surrounded Regions - Problem Statement - Graphs - DFS | Pattern 22: LeetCode Interview Patterns | Repovive

Repovive.

Pattern 22: LeetCode Interview Patterns24 sections · 736 units32h total

Open in Course

LeetCode 130 Surrounded Regions - Problem Statement

The problem

Given an m × n board with 'X' and 'O', capture all regions of 'O' that are completely surrounded by 'X'.

A region is captured by flipping all 'O's to 'X's. Regions connected to the border cannot be captured.

With board:

X X X X
X O O X
X X O X
X O X X

After capturing:

X X X X
X X X X
X X X X
X O X X

The 'O' at (3,1) is connected to the border (left edge), so it's not captured.

Constraints: $1 \le m, n \le 200$ .