From 551a9dff1de9f9d99381a11026f8af23c63121cc Mon Sep 17 00:00:00 2001
From: Hriday-A <hriday.agarwal20103@gmail.com>
Date: Sat, 25 Apr 2026 00:21:02 -0500
Subject: [PATCH] Completed Array-2 Assignment

---
 find_disappered_numbers.java | 19 +++++++++++++++
 game_of_life.java            | 45 ++++++++++++++++++++++++++++++++++++
 min_max.java                 | 37 +++++++++++++++++++++++++++++
 3 files changed, 101 insertions(+)
 create mode 100644 find_disappered_numbers.java
 create mode 100644 game_of_life.java
 create mode 100644 min_max.java

diff --git a/find_disappered_numbers.java b/find_disappered_numbers.java
new file mode 100644
index 00000000..518edb59
--- /dev/null
+++ b/find_disappered_numbers.java
@@ -0,0 +1,19 @@
+class Solution {
+    public List<Integer> findDisappearedNumbers(int[] nums) {
+        int n= nums.length;
+        for(int i=0;i<n;i++){
+            int num= nums[i];
+            int idx= Math.abs(num)-1;
+            if(nums[idx]>0){
+                nums[idx]*=-1;
+            }
+        }
+        List<Integer> result = new ArrayList<>();
+        for(int i=0;i<n;i++){
+            if(nums[i]>0){
+                result.add(i+1);
+            }
+        }
+        return result;
+    }
+}
\ No newline at end of file
diff --git a/game_of_life.java b/game_of_life.java
new file mode 100644
index 00000000..6bf50209
--- /dev/null
+++ b/game_of_life.java
@@ -0,0 +1,45 @@
+class Solution {
+    int[][] dirs;
+    int m;
+    int n;
+    public void gameOfLife(int[][] board) {
+        //1-->0==2
+        //0-->1 == 3
+        this.m = board.length;
+        this.n = board[0].length;
+        this.dirs = new int[][]{{-1,-1}, {-1,0}, {-1, 1}, {0, -1}, {0, 1}, {1,-1}, {1,0}, {1,1}};
+        for(int i=0;i<m;i++){
+            for(int j=0;j<n;j++){
+                int count= getCount(board,i,j);
+                if(board[i][j]==0 && count==3){
+                    board[i][j]=3;
+                }
+                else if(board[i][j]==1 &&(count < 2 || count >3)){
+                    board[i][j]=2;
+                }
+            }
+        }
+        for(int i=0;i<m;i++){
+            for(int j=0;j<n;j++){
+                if(board[i][j]==2){
+                    board[i][j]=0;
+                }
+                if(board[i][j]==3){
+                    board[i][j]=1;
+                }
+            }
+            }
+    }
+    private int getCount(int[][] board,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){ 
+                if(board[r][c] == 1 || board[r][c] == 2) count++;
+            }
+        }
+        return count;
+    }
+
+}
\ No newline at end of file
diff --git a/min_max.java b/min_max.java
new file mode 100644
index 00000000..1972e1d1
--- /dev/null
+++ b/min_max.java
@@ -0,0 +1,37 @@
+public class Problem3 {
+
+    public int[] findMinAndMax(int[] nums) {
+        int n = nums.length;
+        int min, max;
+        int i;
+
+        // Handle first pair (or first element if odd length)
+        if (n % 2 == 0) {
+            if (nums[0] < nums[1]) {
+                min = nums[0];
+                max = nums[1];
+            } else {
+                min = nums[1];
+                max = nums[0];
+            }
+            i = 2;
+        } else {
+            min = max = nums[0];
+            i = 1;
+        }
+
+        // Process pairs
+        while (i < n - 1) {
+            if (nums[i] < nums[i + 1]) {
+                min = Math.min(min, nums[i]);
+                max = Math.max(max, nums[i + 1]);
+            } else {
+                min = Math.min(min, nums[i + 1]);
+                max = Math.max(max, nums[i]);
+            }
+            i += 2;
+        }
+
+        return new int[]{min, max};
+    }
+}