Practice Maximum Number of Consecutive Values You Can Make
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given an integer array coins of length n which represents the n coins that you own. The value of the ith coin is coins[i]. You can make some value x if you can choose some of your n coins such that their values sum up to x. Return the maximum number of consecutive integer values that you can make with your coins starting from and including 0. Note that you may have multiple coins of the same value.
Source: Maximum Number of Consecutive Values You Can Make on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
coins = [1,3]
2
# Example 2
coins = [1,1,1,4]
8
# Example 3
coins = [1,4,10,3,1]
20
Constraints
Related LeetCode Problems
Practice more problems similar to Maximum Number of Consecutive Values You Can Make.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.