diff --git a/Problem1.java b/Problem1.java
new file mode 100644
index 0000000..473467c
--- /dev/null
+++ b/Problem1.java
@@ -0,0 +1,50 @@
+//TC - O(m * n)
+//SC - O(n)
+
+import java.util.LinkedList;
+import java.util.Queue;
+
+public class Problem1 {
+    int[][] dirs = {{0,1}, {0,-1}, {1,0}, {-1,0}};
+    public int orangesRotting(int[][] grid) {
+        int freshOranges = 0;
+        Queue<int[]> q = new LinkedList<>();
+        for(int i =0;i<grid.length;i++) {
+            for(int j = 0;j<grid[i].length;j++) {
+                if(grid[i][j] == 1) {
+                    freshOranges++;
+                } else if(grid[i][j] == 2) {
+                    q.add(new int[]{i, j});
+                }
+            }
+        }
+
+        if(freshOranges == 0) return 0;
+        if(q.isEmpty()) return -1;
+        int time = 0;
+        while(!q.isEmpty()) {
+            time++;
+            int size = q.size();
+            for(int i = 0;i<size;i++) {
+                int[] temp = q.poll();
+                int r = temp[0];
+                int c = temp[1];
+
+                for(int[] dir : dirs) {
+                    int nr = r + dir[0];
+                    int nc = c + dir[1];
+
+                    if(nr >= 0 && nc >= 0 && nr < grid.length && nc < grid[0].length && grid[nr][nc] == 1) {
+                        freshOranges--;
+                        grid[nr][nc] = 2;
+                        q.add(new int[]{nr, nc});
+                    }
+                }
+            }
+
+            
+        }
+
+        return freshOranges == 0 ? time-1 : -1;
+    }
+}
\ No newline at end of file
diff --git a/Problem2.java b/Problem2.java
new file mode 100644
index 0000000..58d0ea2
--- /dev/null
+++ b/Problem2.java
@@ -0,0 +1,28 @@
+//TC = O(n)
+//SC - O(n) 
+
+import java.util.HashMap;
+import java.util.List;
+
+public class Problem2 {
+    public int getImportance(List<Employee> employees, int id) {
+        HashMap<Integer, Employee> hmap = new HashMap<>();
+        for(Employee e : employees) {
+            hmap.put(e.id, e);
+        }
+
+        return dfs(id, hmap);
+    }
+
+    private int dfs(int id, HashMap<Integer, Employee> hmap) {
+
+        
+        Employee e = hmap.get(id);
+        int result = e.importance;
+        for(Integer i : e.subordinates) {
+            result += dfs(i, hmap);
+        }
+
+        return result;
+    }
+}