python solution - faster than 97.02%
\nclass Solution:\n    def plusOne(self, digits: List[int]) -> List[int]:\n        for idx in range(len(digits)-1, -1, -1):\n            if digits[idx] != 9:\n 
```\nclass Solution:\n    def plusOne(self, digits: List[int]) -> List[int]:\n        for idx in range(len(digits)-1, -1, -1):\n            if digits[idx] != 9:\n                digits[idx] += 1\n                break\n            else:\n                digits[idx] = 0\n        if digits[0] == 0:\n            digits.insert(0, 1)\n        return digits\n```
['Python']