js solution 994 (#189)

* added js solution to _3 * js solution to _17 * added js solution links to readme * updated links to js solutions * added js solution 994 * added solution link to readme --------- Co-authored-by: sambabib <adekyte.gmail.com>

Author: sambabib

javascript/_994.js

@@ -0,0 +1,57 @@
+function orangesRotting(grid) {
+const rows = grid.length;
+const cols = grid[0].length;
+let queue = [];
+let freshOranges = 0;
+
+// Initialize the queue with all rotten oranges and count fresh oranges
+for (let r = 0; r < rows; r++) {
+for (let c = 0; c < cols; c++) {
+if (grid[r][c] === 2) {
+queue.push([r, c]);
+} else if (grid[r][c] === 1) {
+freshOranges++;
+}
+}
+}
+
+// If there are no fresh oranges, return 0
+if (freshOranges === 0) return 0;
+
+let minutes = 0;
+const directions = [
+[0, 1], // right
+[1, 0], // down
+[0, -1], // left
+[-1, 0] // up
+];
+
+// Step 2: Perform BFS
+while (queue.length > 0) {
+let size = queue.length;
+let newRotten = false;
+
+for (let i = 0; i < size; i++) {
+let [x, y] = queue.shift();
+
+for (let [dx, dy] of directions) {
+let nx = x + dx;
+let ny = y + dy;
+
+// Check if the neigring cell is a fresh orange
+if (nx >= 0 && ny >= 0 && nx < rows && ny < cols && grid[nx][ny] === 1) {
+grid[nx][ny] = 2; // Make it rotten
+freshOranges--; // Decrease count of fresh oranges
+queue.push([nx, ny]); // Add it to the queue
+newRotten = true;
+}
+}
+}
+
+// If rotten oranges exist, increment minutes
+if (newRotten) minutes++;
+}
+
+// Check if there are any fresh oranges left
+return freshOranges === 0 ? minutes : -1;
+}

paginated_contents/algorithms/1st_thousand/README.md

@@ -4,7 +4,7 @@
 | 991 | [Broken Calculator](https://leetcode.com/problems/broken-calculator/) | [Solution](https://.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_991.java) | | Medium | Math, Greedy
 | 981 | [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/) | [Solution](https://.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_981.java) | [:tv:](https://youtu.be/eVi4gDimCoo) | Medium |
 | 997 | [Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/) | [Solution](https://.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_997.java) | | Easy |
-| 994 | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) | [Solution](https://.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_994.java) | | Medium | BFS
+| 994 | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) | [Solution](https://.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_994.java) [Javascript](https://.com/fishercoder1534/Leetcode/blob/master/javascript/_994.js) | | Medium | BFS
 | 993 | [Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/) | [Solution](https://.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_993.java) | | Easy | Tree, BFS
 | 989 | [Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/) | [Solution](https://.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_989.java) | | Easy | Array
 | 988 | [Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf/) | [Solution](https://.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_988.java) | | Medium | Tree, DFS