Simple JAVA Solution.
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 smallestIndex = Integer.MAX_VALUE;\n        for(int i = 0; i < nums.length; i++) {\n            if(i % 10 == nums[i]) {\n                smallestIndex = Integer.min(smallestIndex, i);\n            }\n            if(i == nums.length - 1 && smallestIndex == Integer.MAX_VALUE) {\n                return -1;\n            }\n        }\n        return smallestIndex;\n    }\n}\n```
['Array', 'Java']