From 10ee62afee36ba25fdd81d4d18dab669951a2370 Mon Sep 17 00:00:00 2001
From: Lakshmi Durga <lakshmibhushant@gmail.com>
Date: Sun, 16 Aug 2026 22:05:24 -0700
Subject: [PATCH] Completed both the problems

---
 find_all_numbers_disappered_in_an_array.java | 20 ++++++++++
 game_of_life.java                            | 41 ++++++++++++++++++++
 2 files changed, 61 insertions(+)
 create mode 100644 find_all_numbers_disappered_in_an_array.java
 create mode 100644 game_of_life.java

diff --git a/find_all_numbers_disappered_in_an_array.java b/find_all_numbers_disappered_in_an_array.java
new file mode 100644
index 00000000..32308107
--- /dev/null
+++ b/find_all_numbers_disappered_in_an_array.java
@@ -0,0 +1,20 @@
+class Solution {
+    public List<Integer> findDisappearedNumbers(int[] nums) {
+        List<Integer> res = new ArrayList<>();
+        int n = nums.length;
+        for(int i =0; i< n; i++) {
+            int value = Math.abs(nums[i])-1;
+            if( nums[value]> 0) {
+                nums[value] *= -1 ;
+            }
+        }
+        for(int j=0; j<n; j++) {
+            if(nums[j] >0) {
+                res.add(j+1);
+            } else {
+                nums[j] *=-1;
+            }
+        }
+        return res;
+    }
+}
\ No newline at end of file
diff --git a/game_of_life.java b/game_of_life.java
new file mode 100644
index 00000000..fcfb8375
--- /dev/null
+++ b/game_of_life.java
@@ -0,0 +1,41 @@
+class Solution {
+    int m ;
+    int n ;
+    public void gameOfLife(int[][] board) {
+        int[][] dir = new int[][]{{-1, -1}, {-1, 0}, {-1, 1}, {0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}};
+         m = board.length;
+         n = board[0].length;
+        for(int i =0; i< m; i++) {
+            for(int j =0; j<n; j++) {
+                int count = getLifeAround(board, dir, i, j);
+                if((board[i][j] == 1 || board[i][j] == 2) && (count < 2 || count > 3)) {
+                    board[i][j] = 2;
+                } else if((board[i][j] == 0 || board[i][j] == 3) && count == 3) {
+                    board[i][j] = 3;
+                }
+            }
+        }
+
+        for(int i =0; i < m; i++) {
+            for(int j =0 ; j< n; j++) {
+                if(board[i][j] == 2) {
+                    board[i][j] = 0;
+                } else if(board[i][j] == 3) {
+                    board[i][j] = 1;
+                }
+            }
+        }
+    }
+
+    private int getLifeAround(int[][] board, int[][] dirs, int i, int j) {
+       int count = 0;
+        for(int[] dir: dirs) {
+            int r = i + dir[0];
+            int c = j + dir[1];
+            if(r>=0 && c>=0 && r<m && c<n && (board[r][c]==1 || board[r][c] == 2)) {
+                count++;
+            }
+        }
+        return count;
+    }
+}
\ No newline at end of file