We use cookies (including Google cookies) to personalize ads and analyze traffic. By continuing to use our site, you accept our Privacy Policy.

Check if Grid Satisfies Conditions

Difficulty: Easy

Problem Description

You are given a 2D matrix grid of size m x n. You need to check if each cell grid[i][j] is:

Equal to the cell below it, i.e. grid[i][j] == grid[i + 1][j] (if it exists).
Different from the cell to its right, i.e. grid[i][j] != grid[i][j + 1] (if it exists).

Return true if all the cells satisfy these conditions, otherwise, return false.

Key Insights

Each cell must be checked against its neighbor below it for equality.
Each cell must also be checked against its neighbor to the right for inequality.
The grid's boundaries need to be respected to avoid index errors.

Space and Time Complexity

Time Complexity: O(m * n)
Space Complexity: O(1)

Solution

To solve the problem, we will iterate through each cell in the 2D grid. For each cell grid[i][j], we will:

Check if it is equal to the cell directly below it (grid[i + 1][j]) if it exists.
Check if it is different from the cell directly to its right (grid[i][j + 1]) if it exists.

If any of these conditions fail, we return false. If we successfully check all cells without finding any discrepancies, we return true.

Code Solutions

def checkGrid(grid):
    m, n = len(grid), len(grid[0])
    for i in range(m):
        for j in range(n):
            if i + 1 < m and grid[i][j] != grid[i + 1][j]:
                return False  # Check cell below
            if j + 1 < n and grid[i][j] == grid[i][j + 1]:
                return False  # Check cell to the right
    return True  # All conditions satisfied

← Back to All Questions