100% Beats, Easy and Optimal Approach For Beginners.
IntuitionApproachBruteForce ApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->
BruteForce Approach
# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->
       O(N)
- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->
       O(1)
# Code
```java []
class Solution {
    public int smallestEqual(int[] nums) { 
        int index = -1;
        for(int i=0; i<nums.length; i++){
            if( i % 10 == nums[i]){
                index = i;
                break;
            }
        }
        return index;
    }
}
```
['Array', 'Java']