Maximum Path Score in a Grid | Leetcode 3742 | DP | Recursion | Memoization | Bottom up | Grid

In this video, we will solve Maximum Path Score in a Grid (Leetcode 3742) step by step.

📌 Approach covered:
1. Recursion: Try all paths (up/left) while tracking cost, and return max score only if cost ≤ k; otherwise discard path.
2. Memoization (Top-down): Cache results for state (i, j, cost) to avoid recomputation, ensuring cost includes current cell before lookup.
3. Bottom-up DP: Build a 3D DP table where dp[i][j][c] stores max score reaching (i,j) using c cost, transitioning from top/left states.

Problem: Maximum Path Score in a Grid
My solutions on Github (C++ & JAVA) : https://github.com/pragya9460/Leetcode/blob/main/Daily_Leetcode_Challenge/April-2026/30_Maximum_Path_Score_in_a_Grid.java
Leetcode Link: https://leetcode.com/problems/maximum-path-score-in-a-grid/

Lets code with pragya

3742. Maximum Path Score in a Grid

Leetcode today

My leetcode playlist: https://www.youtube.com/watch?v=kKswOr7jWpc&list=PL78swWyrkuHkUI9JVwJj_ltxxw_34MaIq&index=1

#leetcode #dsa #javaprogramming #cpp #softwareengineer #programming #graph #leetcode #codewithpragya #codinginterview #practice #interview #array #grid #matrix #dp #recursion #memoization

Видео Maximum Path Score in a Grid | Leetcode 3742 | DP | Recursion | Memoization | Bottom up | Grid канала Pragya Gupta