Another One Python Interview Question

We're trying to create a digital clone of DJ Khaled. No fancy AI or alorithms needed.

Just take a number and add another one:

More specifically, you are given an integer array , where each is the ith digit of positive whole number. It is ordered from most significant to least significant digit.

Return an array of digits of the number after adding another one to the input.

Example #1

Input:

Output:

Example #2

Input:

Output:

Let's break the problem down into an easier version:

What if the last digit is not ? In that case, all we need to do is add to the last digit and return the updated array.

Here's how it works if we guarantee that the last digit is not :

But what happens when the last digit is ?

When the last digit is , adding turns it into , and we carry the over to the previous digit.

However, there's a catch: multiple digits might be , meaning we need to keep carrying the leftward until we find a digit that's not .

Steps to Solve This

1. Start from the last digit and move left while the current digit is .
2. Change each to and carry the to the digit before it.
3. When we break out of the loop, we have two possible cases:
   • Case 1: All digits were (e.g., → ), so we prepend to the list.
   • Case 2: We found a digit that’s not , so we just add to it and return the updated list.

Here's the full code: