[Python3] O(n) | Simple Solution
IntuitionGiven that I can express values ranging from 0 to x with n coins, when a new coin of value y is introduced, I can express values from 0 to x + y using
# Intuition
Given that I can express values ranging from 0 to x with n coins, when a new coin of value y is introduced, I can express values from 0 to x + y using these n + 1 coins.

# Complexity
- Time complexity:
$$O(n)$$

- Space complexity:
$$O(1)$$

# Code
```python3 []
from typing import List


class Solution:
    def getMaximumConsecutive(self, coins: List[int]) -> int:
        coins.sort()
        max_expressable = 0
        for coin in coins:
            if coin > max_expressable + 1:
                break
            max_expressable += coin
        return max_expressable + 1
```
['Python3']