Adding the solution of Path with Minimum Effort (#123)

Author: SauravP97

Java/path-with-minimum-effort.java

@@ -0,0 +1,90 @@
+/** 
+ *  Problem Name : Path with Minimum Effort
+ *  Concept Involved : Graphs, Dijkstra's Shortest Path
+ * 
+ *  Execution Time : 1229 ms
+ *  Memory Consumed : 39.4 mb
+ * 
+*/
+class Point{
+    int x;
+    int y;
+    int height;
+
+    public Point(int x, int y, int height){
+        this.x = x;
+        this.y = y;
+        this.height = height;
+    }
+}
+class Solution {
+    public int minimumEffortPath(int[][] heights) {
+        int n = heights.length;
+        int m = heights[0].length;
+
+        int sx = 0;
+        int sy = 0;
+
+        int[][] dist = new int[n][m];
+        int[][] vis = new int[n][m];
+
+        for(int i=0; i<n; i++){
+            for(int j=0; j<m; j++){
+                dist[i][j] = Integer.MAX_VALUE;
+            }
+        }
+        dist[sx][sy] = 0;
+
+        for(int i=0; i<n; i++){
+            for(int j=0; j<m; j++){
+                int px = -1;
+                int py = -1;
+                int mdist = Integer.MAX_VALUE;
+
+                for(int k=0; k<n; k++){
+                    for(int l=0; l<m; l++){
+                        if(mdist > dist[k][l] && vis[k][l]==0){
+                            mdist = dist[k][l];
+                            px = k;
+                            py = l;
+                        }
+                    }
+                }
+
+                vis[px][py] = 1;
+                Point cpoint = new Point(px, py, heights[px][py]);
+
+                if(cpoint.x > 0){
+                    int lx = cpoint.x - 1;
+                    int ly = cpoint.y;
+                    if(vis[lx][ly] == 0){
+                        dist[lx][ly] = Math.min(dist[lx][ly], Math.max(dist[cpoint.x][cpoint.y], Math.abs(cpoint.height - heights[lx][ly])));
+                    }
+                }
+                if(cpoint.x < n-1){
+                    int lx = cpoint.x + 1;
+                    int ly = cpoint.y;
+                    if(vis[lx][ly] == 0){
+                        dist[lx][ly] = Math.min(dist[lx][ly], Math.max(dist[cpoint.x][cpoint.y], Math.abs(cpoint.height - heights[lx][ly])));
+                    }
+                }
+                if(cpoint.y > 0){
+                    int lx = cpoint.x;
+                    int ly = cpoint.y - 1;
+                    if(vis[lx][ly] == 0){
+                        dist[lx][ly] = Math.min(dist[lx][ly], Math.max(dist[cpoint.x][cpoint.y], Math.abs(cpoint.height - heights[lx][ly])));
+                    }
+                }
+                if(cpoint.y < m-1){
+                    int lx = cpoint.x;
+                    int ly = cpoint.y + 1;
+                    if(vis[lx][ly] == 0){
+                        dist[lx][ly] = Math.min(dist[lx][ly], Math.max(dist[cpoint.x][cpoint.y], Math.abs(cpoint.height - heights[lx][ly])));
+                    }
+                }
+            }
+        }
+
+        return dist[n-1][m-1];
+    }
+}

README.md

@@ -373,7 +373,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | 947  | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/) | [C++](./C++/Most-Stones-Removed-with-Same-Row-or-Column.cpp) | _O(V)_          | _O(2V)_   | Medium     | Graph | Union Find                        |  | [C++](./C++/Most-Stones-Removed-with-Same-Row-or-Column.cpp) | _O(V)_ | _O(2V)_ | Medium | Graph | Union Find |
 | 210  | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)                                                   | [C++](./C++/Course-Schedule-II.cpp)                          | _O(V+E)_        | _O(V)_    | Medium     | Graph | BFS                               |
 | 1627 | [Graph Connectivity with Threshold](https://leetcode.com/problems/graph-connectivity-with-threshold/)                     | [Java](./Java/graph_connectivity_with_threshold.java)        | _O(V.logV + Q)_ | _O(V)_    | Hard       | Graph | Union Find + Sieve                |
-
+| 1631 | [Path with Minimum Effort](https://leetcode.com/problems/path-with-minimum-effort/)                                   | [Java](./Java/path-with-minimum-effort.java)                        | _O(V^2)_ | _O(V)_  | Medium     | Graph | Dijkstra's Shortest Path |
 <br/>
 <div align="right">
     <b><a href="#algorithms">⬆️ Back to Top</a></b>
@@ -437,7 +437,7 @@ DISCLAIMER: This above mentioned resources have affiliate links, which means if
 | [James Y](https://github.com/jameszu) <br> <img src="https://avatars0.githubusercontent.com/u/41566813?s=400&u=af77d15517566ea590a316030b4a6d402b0041b6&v=4" width="100" height="100">          | New Zealand  | python               | [Github](https://github.com/jameszu)                                                                                                                                                                                        |
 | [Hamza B](https://github.com/9Hamza) <br> <img src="https://avatars2.githubusercontent.com/u/56516922?s=400&u=2c1adeef0194a2859361d464f28783bfba698638&v=4" width="100" height="100">           | Saudi Arabia | Java                 | [Github](https://github.com/9Hamza)                                                                                                                                                                                         |
 | [Meli Haktas](https://github.com/MercerFrey) <br> <img src="https://avatars1.githubusercontent.com/u/29127873?s=460&u=149319db4468ec2316e49a75eb5e05b35eb05eef&v=4" width="100" height="100">   | Turkey       | python               | [Github](https://github.com/MercerFrey)                                                                                                                                                                                     |
-| [Saurav Prateek](https://github.com/SauravP97) <br> <img src="https://avatars3.githubusercontent.com/u/26816418?s=460&u=4b5222d5b6db79389efba062714c9dfba263732f&v=4" width="100" height="100"> | India        | Java                 | [Github](https://github.com/SauravP97)                                                                                                                                                                                      |
+| [Saurav Prateek](https://github.com/SauravP97) <br> <img src="https://avatars3.githubusercontent.com/u/26816418?s=460&u=4b5222d5b6db79389efba062714c9dfba263732f&v=4" width="100" height="100"> | India        | Java                 | [Github](https://github.com/SauravP97)  <br> [Codechef](https://www.codechef.com/users/srvptk) <br> [Codeforces](https://codeforces.com/profile/srvptk97) <br> [Leetcode](https://leetcode.com/srvptk97) |                                                                                                                                                                                    |
 
 <br/>
 <div align="right">