Available question text
Given an integer represented as a digit array and an integer k, compute the array-form of num + k by simulating addition from the least-significant digit, handling carries and differing lengths. This can be done in O(max(n, log k)) time and O(1) extra space (excluding output).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 989. Add to Array-Form of Integer
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source