Leetcode Problem 1020. Number of Enclaves

1020. Number of Enclaves

Leetcode Solutions

Initialize m and n to store the number of rows and columns in the grid.
Create a 2D array visited to keep track of visited cells.
Iterate over all cells on the grid's boundary. If a cell is a land cell and not visited, perform DFS from that cell.
In DFS, if the current cell is out of bounds, a water cell, or visited, return. Otherwise, mark it as visited and call DFS on its neighbors.
After DFS, iterate over the grid and count the number of unvisited land cells.
Return the count of unvisited land cells as the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen