Python O(N)
Intuition JUET\n Describe your first thoughts on how to solve this problem. \n\n# Approach easy understanding \n Describe your approach to solving the problem. 
# Intuition JUET\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach easy understanding \n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: best: O(1)\n-                  wrost :O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(1)\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        n=len(nums)\n        for i in range(n):\n            if i%10==nums[i]:\n                return i\n        return -1\n```
['Array', 'Python3']