Available question text
Find the smallest index i in nums such that the sum of the decimal digits of nums[i] equals i, or return -1 if no such index exists. With n ≤ 100 and nums[i] ≤ 1000, a simple linear scan computing digit sums suffices.
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 3550. Smallest Index With Digit Sum Equal to Index
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source