Register for our webinar

1 hour

Step 1

Step 2

Congratulations!

You have registered for our webinar

Oops! Something went wrong while submitting the form.

Step 1

Step 2

Confirmed

You are scheduled with Interview Kickstart.

Redirecting...

Oops! Something went wrong while submitting the form.

Head of Career Skills Development & Coaching

*Based on past data of successful IK students

Given a non-negative number as an integer array `digits`

, where `digits[i]`

represents `ith`

digit of the given number. Add one to the number and return its digits array.

```
{
"digits": "[4, 5, 6]"
}
```

Output:

```
[4, 5, 7]
```

number = 456

number + 1 = 457

```
{
"digits": "[9, 9]"
}
```

Output:

```
[1, 0, 0]
```

- The digits are ordered from most significant to least significant in left-to-right order.
- The given number does not contain any leading zeros.

Constraints:

- 1 <= size of the
`digits`

array <= 10^{4} - 0 <= any element of the
`digits`

array <= 9

```
/*
Asymptotic complexity in terms of length of the given list \`n\`:
* Time: O(n).
* Auxiliary space: O(1).
* Total space: O(n).
*/
vector<int> add_one(vector<int> digits) {
int n = digits.size();
int carry = 1;
for(int i = digits.size() - 1; i >= 0; i--){
int sum = digits[i] + carry;
carry = (sum >= 10) ? 1 : 0;
digits[i] = sum % 10;
}
if(carry != 0) {
// if carry is not zero append it to the beginning
digits.insert(digits.begin(), 1);
}
return digits;
}
```

We hope that these solutions to the add one problem have helped you level up your coding skills. You can expect problems like these at top tech companies like Amazon and Google.

If you are preparing for a tech interview at FAANG or any other Tier-1 tech company, register for Interview Kickstart’s FREE webinar to understand the best way to prepare.

Interview Kickstart offers interview preparation courses taught by FAANG+ tech leads and seasoned hiring managers. Our programs include a comprehensive curriculum, unmatched teaching methods, and career coaching to help you nail your next tech interview.

We offer 18 interview preparation courses, each tailored to a specific engineering domain or role, including the most in-demand and highest-paying domains and roles, such as:

- Back-end Engineering Interview Course
- Front-end Engineering Interview Course
- Full Stack Developer Interview Course

To learn more, register for the FREE webinar.

Note: Input and Output will already be taken care of.

Given a non-negative number as an integer array `digits`

, where `digits[i]`

represents `ith`

digit of the given number. Add one to the number and return its digits array.

```
{
"digits": "[4, 5, 6]"
}
```

Output:

```
[4, 5, 7]
```

number = 456

number + 1 = 457

```
{
"digits": "[9, 9]"
}
```

Output:

```
[1, 0, 0]
```

- The digits are ordered from most significant to least significant in left-to-right order.
- The given number does not contain any leading zeros.

Constraints:

- 1 <= size of the
`digits`

array <= 10^{4} - 0 <= any element of the
`digits`

array <= 9

```
/*
Asymptotic complexity in terms of length of the given list \`n\`:
* Time: O(n).
* Auxiliary space: O(1).
* Total space: O(n).
*/
vector<int> add_one(vector<int> digits) {
int n = digits.size();
int carry = 1;
for(int i = digits.size() - 1; i >= 0; i--){
int sum = digits[i] + carry;
carry = (sum >= 10) ? 1 : 0;
digits[i] = sum % 10;
}
if(carry != 0) {
// if carry is not zero append it to the beginning
digits.insert(digits.begin(), 1);
}
return digits;
}
```

We hope that these solutions to the add one problem have helped you level up your coding skills. You can expect problems like these at top tech companies like Amazon and Google.

If you are preparing for a tech interview at FAANG or any other Tier-1 tech company, register for Interview Kickstart’s FREE webinar to understand the best way to prepare.

Interview Kickstart offers interview preparation courses taught by FAANG+ tech leads and seasoned hiring managers. Our programs include a comprehensive curriculum, unmatched teaching methods, and career coaching to help you nail your next tech interview.

We offer 18 interview preparation courses, each tailored to a specific engineering domain or role, including the most in-demand and highest-paying domains and roles, such as:

- Back-end Engineering Interview Course
- Front-end Engineering Interview Course
- Full Stack Developer Interview Course

To learn more, register for the FREE webinar.

**Attend our free webinar to amp up your career and get the salary you deserve.**

Hosted By

Ryan Valles

Founder, Interview Kickstart