🚀

End of Year Sale: Use Coupon Code END2025 to Get Extra 25% Off.

09DAYS
:
12HOURS
:
33MINUTES
:
27SECONDS

Leetcode Problem 1155. Number of Dice Rolls With Target Sum

1155. Number of Dice Rolls With Target Sum

Leetcode Solutions

Bottom-Up Dynamic Programming Approach

  1. Initialize a 2D array dp with dimensions (n+1) x (target+1) and set all values to 0.
  2. Set dp[n][target] to 1.
  3. Loop over diceIndex from n-1 to 0. a. For each diceIndex, loop over currSum from 0 to target. b. Initialize ways to 0. c. Loop over the face values i from 1 to k. i. If currSum + i is less than or equal to target, add dp[diceIndex + 1][currSum + i] to ways. d. Set dp[diceIndex][currSum] to ways modulo 10^9 + 7.
  4. Return dp[0][0] as the final answer.
UML Thumbnail

Top-Down Dynamic Programming Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...