From e117ae9bb77b4b145b61661c295052377fa39c50 Mon Sep 17 00:00:00 2001
From: WK Wong <wingkwong.code@gmail.com>
Date: Tue, 18 Jun 2024 21:35:01 +0800
Subject: [PATCH] solutions: 3142 - Check if Grid Satisfies Conditions (Easy)

---
 ...check-if-grid-satisfies-conditions-easy.md | 79 +++++++++++++++++++
 1 file changed, 79 insertions(+)
 create mode 100644 solutions/3100-3199/3142-check-if-grid-satisfies-conditions-easy.md

diff --git a/solutions/3100-3199/3142-check-if-grid-satisfies-conditions-easy.md b/solutions/3100-3199/3142-check-if-grid-satisfies-conditions-easy.md
new file mode 100644
index 0000000000..445f2da688
--- /dev/null
+++ b/solutions/3100-3199/3142-check-if-grid-satisfies-conditions-easy.md
@@ -0,0 +1,79 @@
+---
+description: "Author: @wingkwong | https://leetcode.com/problems/check-if-grid-satisfies-conditions/"
+tags: [Array, Matrix]
+---
+
+# 3142 - Check if Grid Satisfies Conditions (Easy)
+
+## Problem Link
+
+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)$ where $n$ is the number of rows and $m$ is the number of columns
+- Space Complexity: $O(1)$
+
+<Tabs>
+<TabItem value="py" label="Python">
+<SolutionAuthor name="@wingkwong"/>
+
+```py
+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
+```
+
+</TabItem>
+</Tabs>