Solution: Regions Cut by Slashes

Explore how to apply the Union Find algorithm to solve the problem of counting regions formed by slashes within an n by n grid. Understand how to divide each grid cell into four parts and merge them based on slash characters, then connect these parts across adjacent cells. By the end, you will be able to implement this method efficiently, grasp its time and space complexity, and accurately determine the number of distinct regions in a slash-divided grid.

We'll cover the following...

Statement
Solution
- Time complexity
- Space Complexity

Statement

An $n \times n$ grid is composed of $n$ , $1 \times 1$ squares, where each $1 \times 1$ square consists of a “/”, “\”, or a blank space. These characters divide the square into adjacent regions.

Given the grid represented as a string array, return the number of regions.

Note:

Backslash characters are escaped, so “\” is represented as “\\”.

A $1 \times 1$ square in the grid will be referred to as a box.

Constraints:

The grid consists of only “/”, “\”, or " " characters.
1 $\leq$ grid.length $\leq$

...