Fastest and Easiest solution in python🔥
\n\n\n\n# Approach\nAnswer lies in the hint:\nIf you can make the first x values and you have a value v, then you can make all the values \u2264 v + x\n\nThe co
\n![Screenshot 2024-06-16 072521.png](https://assets.leetcode.com/users/images/bb81f3c1-3c3a-46d1-bef6-4204c84ec3ed_1718502962.7985275.png)\n\n\n# Approach\nAnswer lies in the hint:\nIf you can make the first x values and you have a value v, then you can make all the values \u2264 v + x\n\nThe code is self explainatory\n\n# Code\n```\nclass Solution:\n    def getMaximumConsecutive(self, coins: List[int]) -> int:\n        coins.sort()\n        r=1\n\n        for c in coins:\n            if c>r:\n                break\n            else:\n                r+=c\n        return r\n        \n```
['Python3']