All Tracks>Algorithms> Graphs> Depth First Search> Problem
Areas
★★★★★

3.2

22 votes
Algorithms, Depth First Search, Graphs
Problem

You are given a 2D grid. A '#' represents an obstacle and a '.' represents free space. You need to find the areas of the disconnected components. The cells (i+1, j), (i, j+1), (i-1, j), (i, j-1) are the adjacent to the cell (i, j).

There are multiple test cases in this problem.

Sample Input
3
3 3
##.
..#
#.#
3 5
#.#.#
.#.#.
#.#.#
4 4
..##
..##
##..
##..
Sample Output
2
1 3 
7
1 1 1 1 1 1 1 
2
4 4
Time Limit: 2
Memory Limit: 256
Source Limit:
Explanation

In the first test case, there are 2 components with areas 1 and 3 respectively.

Contributers:
Editor Image

?