SDET

You are given two integers 'n' and 'm', the dimensions of a grid. The coordinates are from (0, 0) to (n - 1, m - 1).

The grid can only have values 0 and 1.

The value is 0 if there is water and 1 if there is land.

An island is a group of ‘1’s such that every ‘1’ has at least another ‘1’ sharing a common edge.

You are given an array 'queries' of size 'q'.

Each element in 'queries' contains two integers 'x' and 'y', referring to the coordinates in the grid.

Initially, the grid is filled with 0, which means only water and no land.

At each query, the value of 'grid' at (x, y) becomes 1, which means it becomes land.

Find out, after each query, the number of islands in the grid.

Example :

Input: 'n' = 3, 'm' = 4
'queries' = [[1, 1], [1, 2], [2, 3]]

Output: [1, 1, 2]

Explanation:

Initially, the grid was:
0 0 0 0
0 0 0 0
0 0 0 0

After query (1, 1):
0 0 0 0
0 1 0 0
0 0 0 0
There is one island having land (1, 1).

After query (1, 2):
0 0 0 0
0 1 1 0
0 0 0 0
Since (1, 1) and (1, 2) share a common edge, they form one island. So there is one island having lands (1, 1) and (1, 2).

After query (2, 3):
0 0 0 0
0 1 1 0
0 0 0 1
Now there are two islands, one having lands (1, 1) and (1, 2), and another having land (2, 3).

So the number of islands after each query is [1, 1, 2].

Scenario provided to develop a tool to develop a tool which manages company's internal labs and plots metrics (lab utilisation) and manages permission management and managing lab's wireless comm. setups

Team collaboration,
Work environment
ability to handle tasks independently
team inter-dependency
exact kind of responsibilities assigned to me