From 56d26374f8411770b1951c242b957af026c80ae1 Mon Sep 17 00:00:00 2001
From: chayan das <dasshuvo817@gmail.com>
Date: Wed, 21 May 2025 23:53:22 +0530
Subject: [PATCH] Create 2901. Longest Unequal Adjacent Groups Subsequence II1

---
 ...st Unequal Adjacent Groups Subsequence II1 | 29 +++++++++++++++++++
 1 file changed, 29 insertions(+)
 create mode 100644 2901. Longest Unequal Adjacent Groups Subsequence II1

diff --git a/2901. Longest Unequal Adjacent Groups Subsequence II1 b/2901. Longest Unequal Adjacent Groups Subsequence II1
new file mode 100644
index 0000000..86c699f
--- /dev/null
+++ b/2901. Longest Unequal Adjacent Groups Subsequence II1	
@@ -0,0 +1,29 @@
+class Solution {
+public:
+    void setZeroes(vector<vector<int>>& matrix) {
+        vector<int> iV;
+        vector<int> jV;
+        int n = matrix.size();
+        int m = matrix[0].size();
+        for(int i=0;i<n;i++){
+            for(int j=0;j<m;j++){
+                if(matrix[i][j]==0){
+                    iV.push_back(i);
+                    jV.push_back(j);
+                }
+            }
+        }
+        
+        for(int i=0;i<iV.size();i++){
+            for(int j=0;j<m;j++){
+                matrix[iV[i]][j]=0;
+            }
+        }
+        
+        for(int j=0;j<jV.size();j++){
+            for(int i=0;i<n;i++){
+                matrix[i][jV[j]]=0;
+            }
+        }
+    }
+};