Add solution #1306

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,219 LeetCode solutions in JavaScript
+# 1,220 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -988,6 +988,7 @@
 1302|[Deepest Leaves Sum](./solutions/1302-deepest-leaves-sum.js)|Medium|
 1304|[Find N Unique Integers Sum up to Zero](./solutions/1304-find-n-unique-integers-sum-up-to-zero.js)|Easy|
 1305|[All Elements in Two Binary Search Trees](./solutions/1305-all-elements-in-two-binary-search-trees.js)|Medium|
+1306|[Jump Game III](./solutions/1306-jump-game-iii.js)|Medium|
 1309|[Decrypt String from Alphabet to Integer Mapping](./solutions/1309-decrypt-string-from-alphabet-to-integer-mapping.js)|Easy|
 1313|[Decompress Run-Length Encoded List](./solutions/1313-decompress-run-length-encoded-list.js)|Easy|
 1317|[Convert Integer to the Sum of Two No-Zero Integers](./solutions/1317-convert-integer-to-the-sum-of-two-no-zero-integers.js)|Easy|

solutions/1306-jump-game-iii.js

@@ -0,0 +1,39 @@
+/**
+ * 1306. Jump Game III
+ * https://leetcode.com/problems/jump-game-iii/
+ * Difficulty: Medium
+ *
+ * Given an array of non-negative integers arr, you are initially positioned at start index of
+ * the array. When you are at index i, you can jump to i + arr[i] or i - arr[i], check if you
+ * can reach any index with value 0.
+ *
+ * Notice that you can not jump outside of the array at any time.
+ */
+
+/**
+ * @param {number[]} arr
+ * @param {number} start
+ * @return {boolean}
+ */
+var canReach = function(arr, start) {
+  const visited = new Set();
+  const queue = [start];
+
+  while (queue.length) {
+    const current = queue.shift();
+
+    if (arr[current] === 0) return true;
+    if (visited.has(current)) continue;
+
+    visited.add(current);
+
+    const jump = arr[current];
+    const nextRight = current + jump;
+    const nextLeft = current - jump;
+
+    if (nextRight < arr.length) queue.push(nextRight);
+    if (nextLeft >= 0) queue.push(nextLeft);
+  }
+
+  return false;
+};