Problem link :
https://leetcode.com/problems/path-with-minimum-effort
1) 0:00 Explaining the problem out loud
2) 1:28 Algorithm walkthrough
3) 16:00 Coding it up
4) 21:00 Time complexity
TC : O(n*mlog(n*m))
SC:O(n*m) length of array
Code Link : https://github.com/Sunchit/Coding-Decoded/blob/master/January2021/PathWithMiniumEffort.java
Repo link : https://github.com/Sunchit/Coding-Decoded/
Complete January Playlist: https://www.youtube.com/playlist?list=PLEI-q7w3s9gR8EhTsObcgM74NnIiAcRWm
Complete December Playlist: https://www.youtube.com/playlist?list=PLEI-q7w3s9gQIB_urBmMV04f_NBelXJEP
Channel link: https://www.youtube.com/c/CodingDecoded
