| # | Title | Solutions | Video | Difficulty | Tag 1

|-----|----------------|---------------|--------|-------------|-------------

|1926|[Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1926.java)||Medium|DP, DFS, BFS|

|1925|[Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1925.java)||Easy|Array, Greedy|

|1920|[Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1920.java)||Easy||

|1913|[Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1913.java)||Easy|Sort|

packagecom.fishercoder.solutions;

importjava.util.LinkedList;

importjava.util.Queue;

publicclass_1926 {

publicstaticclassSolution1 {

publicintnearestExit(char[][]maze,int[]entrance) {

intm =maze.length;

intn =maze[0].length;

int[]directions =newint[]{0,1,0, -1,0};

Queue<int[]>queue =newLinkedList<>();

queue.offer(newint[]{entrance[0],entrance[1],0});

boolean[][]visited =newboolean[m][n];

visited[entrance[0]][entrance[1]] =true;

intshortestSteps =m *n;

while (!queue.isEmpty()) {

int[]curr =queue.poll();

for (inti =0;i <directions.length -1;i++) {

intnextX =curr[0] +directions[i];

intnextY =curr[1] +directions[i +1];

if (nextX >=0 &&nextX <m &&nextY >=0 &&nextY <n &&maze[nextX][nextY] =='.' && !visited[nextX][nextY]) {

visited[nextX][nextY] =true;

if (nextX ==0 ||nextX ==m -1 ||nextY ==0 ||nextY ==n -1) {

shortestSteps =Math.min(shortestSteps,curr[2] +1);

}else {

queue.offer(newint[]{nextX,nextY,curr[2] +1});

}

}

}

}

returnshortestSteps ==m *n ? -1 :shortestSteps;

}

}

}