[Devmates.co] Add One by 🚕Bolt

Hello👋,
My name is Alex and I'm maker of Devmates.co. 😊

We are resolving daily coding problems which asked by top tech companies together. We share our solutions, give some help if anyone stuck, support each other and just hangout together in the internet. 🍻☕️💬

I get this problem from our members or just searching them in the internet(leetcode forums, Glassdoor, teamblind, etc.). Sometimes this problem can be very easy, sometimes too 👷‍♂️hard, everything depends on skills but we are trying to resolve all of them and Have Fun. 🙌

Today I want to share problem which was asked by 🚕Bolt.

Problem:

Given a non-empty array of digits representing a non-negative integer and each element in the array contain a single digit.

Add one (1) to this integer and return it as array.

You may assume the integer does not contain any leading zero, except the number 0 itself.

Note: Converting to the integer and back to the array is not allowed.

Example:

Input: [3,2,1]
Output: [3,2,2]

Input: [9,9,9]
Output: [1,0,0,0]

Input: [5,6,9]
Output: [5,7,0]

🙌 Don't hesitate to share your solutions directly on devmates.co