Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3183. The Number of Ways to Make the Sum
Given a target sum and a list of positive integers (e.g., coin values), count how many distinct ways to form that sum under the problem's rules about reuse and order; this is a counting/knapsack DP problem where you build states for partial sums and usually handle large counts with modulus arithmetic.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.