✔✔JAVA || Simple Logic || Linear solution || 2ms
\nclass Solution {\n    public int smallestEqual(int[] nums) {\n        \n        for(int i=0;i<nums.length;i++){\n            if(i%10==nums[i]) return i;    \n
```\nclass Solution {\n    public int smallestEqual(int[] nums) {\n        \n        for(int i=0;i<nums.length;i++){\n            if(i%10==nums[i]) return i;    \n        }\n        return -1;\n    }\n}\n```\n![image](https://assets.leetcode.com/users/images/31f72a19-d415-49d1-88ec-96e7d8bb7f18_1668054698.499077.png)\n\n**Any Doubt ask down below :-D**
['Java']