Add solution #1926

Author: JoshCrozier

README.md

@@ -504,6 +504,7 @@
 1886|[Determine Whether Matrix Can Be Obtained By Rotation](./1886-determine-whether-matrix-can-be-obtained-by-rotation.js)|Easy|
 1910|[Remove All Occurrences of a Substring](./1910-remove-all-occurrences-of-a-substring.js)|Medium|
 1920|[Build Array from Permutation](./1920-build-array-from-permutation.js)|Easy|
+1926|[Nearest Exit from Entrance in Maze](./1926-nearest-exit-from-entrance-in-maze.js)|Medium|
 1929|[Concatenation of Array](./1929-concatenation-of-array.js)|Easy|
 1935|[Maximum Number of Words You Can Type](./1935-maximum-number-of-words-you-can-type.js)|Easy|
 1985|[Find the Kth Largest Integer in the Array](./1985-find-the-kth-largest-integer-in-the-array.js)|Medium|

solutions/1926-nearest-exit-from-entrance-in-maze.js

@@ -0,0 +1,45 @@
+/**
+ * 1926. Nearest Exit from Entrance in Maze
+ * https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/
+ * Difficulty: Medium
+ *
+ * You are given an m x n matrix maze (0-indexed) with empty cells (represented as '.') and
+ * walls (represented as '+'). You are also given the entrance of the maze, where entrance
+ * = [entrancerow, entrancecol] denotes the row and column of the cell you are initially
+ * standing at.
+ *
+ * In one step, you can move one cell up, down, left, or right. You cannot step into a cell
+ * with a wall, and you cannot step outside the maze. Your goal is to find the nearest exit
+ * from the entrance. An exit is defined as an empty cell that is at the border of the maze.
+ * The entrance does not count as an exit.
+ *
+ * Return the number of steps in the shortest path from the entrance to the nearest exit,
+ * or -1 if no such path exists.
+ */
+
+/**
+ * @param {character[][]} maze
+ * @param {number[]} entrance
+ * @return {number}
+ */
+var nearestExit = function(maze, entrance) {
+  const queue = [[entrance, 0]];
+
+  while (queue.length) {
+    const [cell, steps] = queue.shift();
+    const [i, j] = cell;
+    if (i === maze.length || i === -1 || j === maze[0].length || j === -1 || maze[i][j] !== '.') {
+      continue;
+    }
+    if ((i === maze.length - 1 || i === 0 || j === maze[0].length - 1 || j === 0) && steps !== 0) {
+      return steps;
+    }
+    maze[i][j] = '*';
+    queue.push([[i, j + 1], steps + 1]);
+    queue.push([[i, j - 1], steps + 1]);
+    queue.push([[i + 1, j], steps + 1]);
+    queue.push([[i - 1, j], steps + 1]);
+  }
+
+  return -1;
+};