Top 150 InterviewEasy

Plus One

Detailed guide and Python implementation for the 'Plus One' problem.

Problem Statement

Easy

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.

Implement a function plusOne(digits: list) -> list.

Constraints
  • 1 <= digits.length <= 100
  • 0 <= digits[i] <= 9
  • digits does not contain any leading 0's

Examples

Example 1
Input
[1,2,3]
Output
[1,2,4]
Explanation

The array represents the integer 123. Incrementing by one gives 124.

Example 2
Input
[4,3,2,1]
Output
[4,3,2,2]
Explanation

The array represents the integer 4321. Incrementing by one gives 4322.

Example 3
Input
[9]
Output
[1,0]
Explanation

The array represents the integer 9. Incrementing by one gives 10, which is [1,0].

Need a Hint?
Consider using Math & Geometry-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor

Recommended Python Resources

Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.