diff --git a/Problem62.java b/Problem62.java
new file mode 100644
index 0000000..e3a2737
--- /dev/null
+++ b/Problem62.java
@@ -0,0 +1,47 @@
+// Time Complexity : O(m*n)
+// Space Complexity : O(m*n)
+
+class Solution {
+    public int orangesRotting(int[][] grid) {
+        int[][] dirs = new int[][]{{-1,0},{1,0},{0,1},{0,-1}};
+        int m = grid.length;
+        int n = grid[0].length;
+        int fresh = 0;
+        int time = 0;
+
+        Queue<int[]> q = new LinkedList<>();
+
+        for (int i = 0; i < m; i++) {
+            for (int j = 0; j < n; j++) {
+                if (grid[i][j] == 2) {
+                    q.offer(new int[]{i,j});
+                } else if (grid[i][j] == 1) {
+                    fresh++;
+                }
+            }
+        }
+
+        if (fresh == 0) return time;
+
+        while (!q.isEmpty()) {
+            int size = q.size();
+            time++;
+            for (int i = 0; i < size; i++) {
+                int[] curr = q.poll();
+                for (int[] dir: dirs) {
+                    int r = dir[0] + curr[0];
+                    int c = dir[1] + curr[1];
+
+                    if (r>=0 && c>=0 && r<m && c<n && grid[r][c]==1) {
+                        grid[r][c] = 2;
+                        q.offer(new int[]{r,c});
+                        fresh--;
+                        if (fresh == 0) return time;
+                    }
+                }
+            }
+        }
+
+        return -1;
+    }
+}
\ No newline at end of file
diff --git a/Problem63.java b/Problem63.java
new file mode 100644
index 0000000..82835bb
--- /dev/null
+++ b/Problem63.java
@@ -0,0 +1,28 @@
+// Time Complexity : O(N)
+// Space Complexity : O(N)
+
+class Solution {
+    public int getImportance(List<Employee> employees, int id) {
+        Map<Integer, Employee> empMap = new HashMap<>();
+        int totalImp = 0;
+
+        for (Employee emp: employees) {
+            empMap.put(emp.id, emp);
+        }
+
+        Queue<Integer> q = new LinkedList<>();
+        q.add(id);
+
+        while (!q.isEmpty()) {
+            Employee currEmp = empMap.get(q.poll());
+
+            totalImp += currEmp.importance;
+
+            for (int subId: currEmp.subordinates) {
+                q.add(subId);
+            }
+        }
+
+        return totalImp;
+    }
+}
\ No newline at end of file