BEGGINER FRIENDLY APPROACH || BEATS 90.39% || 2 LINE CODE || 🔥🔥🔥✅✅✅
Approach\n Describe your approach to solving the problem. \nUsing list comprehension we can store all the possible results in a list and then return the minimum
# Approach\n<!-- Describe your approach to solving the problem. -->\nUsing list comprehension we can store all the possible results in a list and then return the minimum value from that list.\n\n# Code\n```\nclass Solution:\n    def smallestEqual(self, nums: List[int]) -> int:\n        l=[i for i in range(len(nums)) if i%10==nums[i]]\n\n        return min(l) if len(l)>0 else -1\n```\n# Proof\n\n![image.png](https://assets.leetcode.com/users/images/a68157f7-bec8-4bd4-a2b3-09b84c735fd0_1698893680.9448953.png)\n
['Python3']