Dice Throws Problem Statement

You are given D dice, each having F faces numbered from 1 to F. The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up numbers equals the given 'target' sum S.

Example:

Input:
2
3 6 8
2 4 5
Output:
21
4
Explanation:

In the first test case, there are 3 dice each with 6 faces and the possible ways to roll them to get a sum of 8 are 21. In the second test case, there are 2 dice each with 4 faces, and there are 4 ways to roll them to reach the sum of 5.

Constraints:

  • 1 ≤ T ≤ 5
  • 1 ≤ D, F ≤ 50
  • 1 ≤ S ≤ 10^3

Note:

As the result can be large, return your answer modulo 10^9 + 7.

Follow Up:

Can you optimize the solution to use no more than O(S) extra space?

Be the first one to answer
Select
Add answer anonymously...

Top Software Developer Interview Questions Asked at Amazon

Q. What is OOPS?
Q. What is Java programming?
Q. Could you describe the process for designing a data structure that allows for al...read more
Software Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app
play-icon
play-icon
qr-code
Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+

Reviews

10L+

Interviews

4 Cr+

Salaries

1.5 Cr+

Users

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2025 Info Edge (India) Ltd.

Follow Us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter
Profile Image
Hello, Guest
AmbitionBox Employee Choice Awards 2025
Winners announced!
awards-icon
Contribute to help millions!
Write a review
Write a review
Share interview
Share interview
Contribute salary
Contribute salary
Add office photos
Add office photos
Add office benefits
Add office benefits