Day 10: Coding Challenge

Problem - We are given a?large integer?represented as an integer array?of digits, where each?digit's[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.

• Solution - The approach is simple we will traverse through the list and check if there is 9 or not, if 9 is present then add 1 and make it to zero and forward but if it is not 9 then add one and continue traversing. The same thing applied to 99, 999,....etc

#leetcodechallenge #leetcode2023 #30daysofcodechallenge #30daysofcode

#problemsolving #codingchallenge #leetcode #practice