(8) Binary Search: Path With Minimum Effort

Question Link and Solution Link Difficulty: Medium Prerequisite: DFS on the grid Problem Statement: Given a 2D grid, you need to find a path such that difference of adjacent elements of that grid is minimum possible. Approach: We will make DFS cal...