Available question text
Find the smallest index i in the array such that i mod 10 == nums[i], or return -1 if none exists. This is a simple linear scan problem using a modular comparison (n ≤ 100, nums[i] in 0..9).
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 2057. Smallest Index With Equal Value
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source