smallest-index-with-equal-value.cpp

// Time:  O(n)
// Space: O(1)

class Solution {
public:
    int smallestEqual(vector<int>& nums) {
        for (int i = 0; i < size(nums); ++i) {
            if (i % 10 == nums[i]) {
                return i;
            }
        }
        return -1;
    }
};