[JAVA] straight forward solution
\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\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 ++) {\n           if(i % 10 == nums[i]) { \n               return i;\n               \n           }\n       }\n        return - 1;  \n    }\n}\n```\n# PLEASE UPVOTE IF IT WAS HELPFULL
['Java']