Add solution #1219

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,182 LeetCode solutions in JavaScript
+# 1,183 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -936,6 +936,7 @@
 1210|[Minimum Moves to Reach Target with Rotations](./solutions/1210-minimum-moves-to-reach-target-with-rotations.js)|Hard|
 1217|[Minimum Cost to Move Chips to The Same Position](./solutions/1217-minimum-cost-to-move-chips-to-the-same-position.js)|Easy|
 1218|[Longest Arithmetic Subsequence of Given Difference](./solutions/1218-longest-arithmetic-subsequence-of-given-difference.js)|Medium|
+1219|[Path with Maximum Gold](./solutions/1219-path-with-maximum-gold.js)|Medium|
 1232|[Check If It Is a Straight Line](./solutions/1232-check-if-it-is-a-straight-line.js)|Easy|
 1233|[Remove Sub-Folders from the Filesystem](./solutions/1233-remove-sub-folders-from-the-filesystem.js)|Medium|
 1249|[Minimum Remove to Make Valid Parentheses](./solutions/1249-minimum-remove-to-make-valid-parentheses.js)|Medium|

solutions/1219-path-with-maximum-gold.js

@@ -0,0 +1,52 @@
+/**
+ * 1219. Path with Maximum Gold
+ * https://leetcode.com/problems/path-with-maximum-gold/
+ * Difficulty: Medium
+ *
+ * In a gold mine grid of size m x n, each cell in this mine has an integer representing the
+ * amount of gold in that cell, 0 if it is empty.
+ *
+ * Return the maximum amount of gold you can collect under the conditions:
+ * - Every time you are located in a cell you will collect all the gold in that cell.
+ * - From your position, you can walk one step to the left, right, up, or down.
+ * - You can't visit the same cell more than once.
+ * - Never visit a cell with 0 gold.
+ * - You can start and stop collecting gold from any position in the grid that has some gold.
+ */
+
+/**
+ * @param {number[][]} grid
+ * @return {number}
+ */
+var getMaximumGold = function(grid) {
+  const rows = grid.length;
+  const cols = grid[0].length;
+  let maxGold = 0;
+
+  for (let i = 0; i < rows; i++) {
+    for (let j = 0; j < cols; j++) {
+      if (grid[i][j] !== 0) {
+        exploreGold(i, j, 0);
+      }
+    }
+  }
+
+  return maxGold;
+
+  function exploreGold(row, col, currentGold) {
+    if (row < 0 || row >= rows || col < 0 || col >= cols || grid[row][col] === 0) {
+      maxGold = Math.max(maxGold, currentGold);
+      return;
+    }
+
+    const goldHere = grid[row][col];
+    grid[row][col] = 0;
+
+    exploreGold(row - 1, col, currentGold + goldHere);
+    exploreGold(row + 1, col, currentGold + goldHere);
+    exploreGold(row, col - 1, currentGold + goldHere);
+    exploreGold(row, col + 1, currentGold + goldHere);
+
+    grid[row][col] = goldHere;
+  }
+};