Leetcode 3550. Smallest Index With Digit Sum Equal to Index

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.