Problem1.py

# first problem is the easy one which I have selected 
#  Question is You are given a large integer represented as an integer array digits, where each digits[i] is 
# the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. 
# The large integer does not contain any leading 0's.
# Increment the large integer by one and return the resulting array of digits.


# Input: digits = [1,2,3] 
# Input: digits = [4,3,2,1]
# Input: digits = [9] 


# SOLUTION 

class Solution(object):
    def plusOne(self,digits):
        n = len(digits)
        for i in range(n - 1, -1, -1):
            if digits[i] < 9:
                digits[i] += 1
                return digits
            digits[i] = 0
        return [1] + digits
# Example usage 
solution = Solution()
print(solution.plusOne([1, 2, 3]))  # Output: [1, 2, 4]
print(solution.plusOne([4, 3, 2, 1]))  # Output: [4, 3, 2, 2]
print(solution.plusOne([9,9]))  # Output: [1, 0]