DSA · Theory

Dynamic Programming (DP) on Grids

Theory

663/810

Dynamic Programming (DP) on Grids

Dynamic Programming (DP) on Grids is a DSA topic. In plain words you use it for min coins for ₹18 in a shop. Don’t start with a slogan — start with that picture.

Smallest example: table + recurrence. Type it, run it, and say what you see. If you can do that from memory, you know Dynamic Programming (DP) on Grids.

From the example next to this theory: Dynamic Programming (DP) on Grids — dP stores subproblem answers so you never recompute them.

Trap — no overlapping subproblems check. Fix that before you talk about advanced DSA.

Viva — what is Dynamic Programming (DP) on Grids? Then show table + recurrence. Then name the trap.

Exam tip

What is Dynamic Programming (DP) on Grids? Show this: table + recurrence. Trap: no overlapping subproblems check.

Example

def fib(n):
    dp = [0, 1] + [0] * max(0, n - 1)
    for i in range(2, n + 1):
        dp[i] = dp[i - 1] + dp[i - 2]
    return dp[n]

print(fib(10))

Dynamic Programming (DP) on Grids — dP stores subproblem answers so you never recompute them.

Short notes

DefDynamic Programming (DP) on Grids — min coins for ₹18 in a shop.
Ruletable + recurrence
Trapno overlapping subproblems check
Usea shop

DSA · Theory

Dynamic Programming (DP) on Grids

← All stacks

Theory

663/810

Dynamic Programming (DP) on Grids

Dynamic Programming (DP) on Grids is a DSA topic. In plain words you use it for min coins for ₹18 in a shop. Don’t start with a slogan — start with that picture.

Smallest example: table + recurrence. Type it, run it, and say what you see. If you can do that from memory, you know Dynamic Programming (DP) on Grids.

From the example next to this theory: Dynamic Programming (DP) on Grids — dP stores subproblem answers so you never recompute them.

Trap — no overlapping subproblems check. Fix that before you talk about advanced DSA.

Viva — what is Dynamic Programming (DP) on Grids? Then show table + recurrence. Then name the trap.

Exam tip

What is Dynamic Programming (DP) on Grids? Show this: table + recurrence. Trap: no overlapping subproblems check.

Example

def fib(n):
    dp = [0, 1] + [0] * max(0, n - 1)
    for i in range(2, n + 1):
        dp[i] = dp[i - 1] + dp[i - 2]
    return dp[n]

print(fib(10))

Dynamic Programming (DP) on Grids — dP stores subproblem answers so you never recompute them.

Short notes

DefDynamic Programming (DP) on Grids — min coins for ₹18 in a shop.
Ruletable + recurrence
Trapno overlapping subproblems check
Usea shop

Dynamic Programming (DP) on Grids

Example

Short notes

Questions

Dynamic Programming (DP) on Grids

Example

Short notes

Questions