Smallest Index With Digit Sum Equal to Index
You are given an integer array nums.
Return the smallest index i such that the sum of the digits of nums[i] is equal to i.
If no such index exists, return -1.
Example 1
Input
nums = [1,3,2]Output
2For
nums[2] = 2, the sum of digits is 2, which is equal to index i = 2, so the output is 2.Example 2
Input
nums = [1,10,11]Output
1Both indices 1 and 2 satisfy the condition, but index 1 is the smallest.
Constraints
- 1 <= nums.length <= 100
- 0 <= nums[i] <= 1000