1 line solution 🔥100% Faster Code 🔥 Beginner Friendly 🔥
Please UPVOTE if helps.\n\n# Complexity\n- Time complexity: O(n)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(1)\n Add your space comple
# Please UPVOTE if helps.\n\n# Complexity\n- Time complexity: $$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    public int smallestEqual(int[] nums) {\n        for (int i = 0; i < nums.length; i++)if (i % 10 == nums[i]) return i;\n        return -1;\n    }\n}\n```
['Java']