Skip to main content

3142 - Check if Grid Satisfies Conditions (Easy)

https://leetcode.com/problems/check-if-grid-satisfies-conditions/

Problem Statement​

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.

Example 1:

Input: grid = [[1,0,2],[1,0,2]]

Output: true

Explanation:

All the cells in the grid satisfy the conditions.

Example 2:

Input: grid = [[1,1,1],[0,0,0]]

Output: false

Explanation:

All cells in the first row are equal.

Example 3:

Input: grid = [[1],[2],[3]]

Output: false

Explanation:

Cells in the first column have different values.

Constraints:

  • 1 <= n, m <= 10
  • 0 <= grid[i][j] <= 9

Approach 1: Brute Force​

Iterate over each cell to check if the conditions can be satisified.

  • Time Complexity: O(n∗m)O(n * m) where nn is the number of rows and mm is the number of columns
  • Space Complexity: O(1)O(1)
Written by @wkw
class Solution:
    def satisfiesConditions(self, grid: List[List[int]]) -> bool:
        n, m = len(grid), len(grid[0])
        for i in range(n):
            for j in range(m):
                if i < n - 1 and grid[i][j] != grid[i + 1][j]: return False
                if j < m - 1 and grid[i][j] == grid[i][j + 1]: return False
        return True