Leetcode 2057. Smallest Index With Equal Value

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2057. Smallest Index With Equal Value

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact