Easy Solution with time complexity of 0ms 🔥🔥🔥
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int smallestEqual(int[] nums) {\n        int ans=-1,a=0;\n        for(int i=0;i<nums.length;i++)\n        {\n            a=i%10;\n            if(a==nums[i])\n            {\n                ans=i;\n                break;\n            }\n        }\n        return ans;\n    }\n}\n```
['Java']