diff --git a/Sample.java b/Sample.java
deleted file mode 100644
index f5c45b5f..00000000
--- a/Sample.java
+++ /dev/null
@@ -1,7 +0,0 @@
-// Time Complexity :
-// Space Complexity :
-// Did this code successfully run on Leetcode :
-// Any problem you faced while coding this :
-
-
-// Your code here along with comments explaining your approach
\ No newline at end of file
diff --git a/findAllDisappeatredNumbers.java b/findAllDisappeatredNumbers.java
new file mode 100644
index 00000000..73593d61
--- /dev/null
+++ b/findAllDisappeatredNumbers.java
@@ -0,0 +1,23 @@
+//TC: O(n)
+//Sc: O(1)
+
+class Solution {
+    public List<Integer> findDisappearedNumbers(int[] nums) {
+        ArrayList<Integer> li = new ArrayList<Integer>();
+        for(int i = 0 ; i< nums.length; i++){
+            int idx = Math.abs(nums[i])-1;
+            if(!(nums[idx] < 0)){        
+             nums[idx] *= -1;
+            }
+        }
+
+        for(int i = 0 ; i< nums.length; i++){
+            if(nums[i] > 0){
+                li.add(i+1);
+            }else{
+                nums[i] = Math.abs(nums[i]);
+            }
+        }
+     return li;   
+    }
+}
\ No newline at end of file
diff --git a/gameOfLife.java b/gameOfLife.java
new file mode 100644
index 00000000..5dd12007
--- /dev/null
+++ b/gameOfLife.java
@@ -0,0 +1,45 @@
+class Solution {
+    public void gameOfLife(int[][] board) {
+        int r = board.length;
+	int c = board[0].length;
+	int[][] result = new int[r][c];
+	
+	for(int i =0; i < r; i++){
+		for(int j =0; j < c; j++){
+			int count1 = countOne(i,j, board);
+			
+			if(board[i][j] == 1){
+				if(count1 < 2 || count1 > 3)
+					board[i][j] = -1;
+			}else{
+				if(count1 == 3)
+					board[i][j] = -2;
+			}
+		}
+	}
+	
+	for(int i =0; i < r; i++){
+		for(int j =0; j < c; j++){
+			if(board[i][j] == -1)
+				board[i][j] = 0;
+			if(board[i][j] == -2)
+				board[i][j] = 1;
+		}
+	}
+	
+    }
+
+
+    private int countOne(int i, int j, int[][] matrix){
+	int[][] dirs = {{0,1},{1,0},{-1,0},{0,-1}, {-1,-1},{1,1},{-1,1},{1,-1}};
+	int count = 0;
+	for(int[] dir : dirs){
+		int row = i + dir[0];
+		int col = j + dir[1];
+		if(row >= 0 && row < matrix.length && col >= 0 && col < matrix[0].length &&  (matrix[row][col] == 1 || matrix[row][col] == -1))
+			count++;
+	}
+ return count;
+}
+
+}
\ No newline at end of file