Py solution simple
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    def smallestEqual(self, nums: List[int]) -> int:\n        lst=[]\n        for i in range(len(nums)):\n            if i%10==nums[i]:\n               lst.append(i)\n        if len(lst)>=1:\n            return min(lst)\n        else:\n            return -1\n```
['Python3']