EASY SOLUTION 100% JAVA or C++ 😉😉👍👍
\n\n\n  \n\n\n\n\n# C++ Solution\n\nclass Solution {\npublic:\n    int smallestEqual(vector<int>& nums) {\n        // i mod 10 == nums[i]\n        for(int i=0;i
\n\n<p align="center">\n  <a href="https://github.com/professorDeveloper"><img src="https://readme-typing-svg.herokuapp.com?font=Time+New+Roman&color=%23C8BE25&size=25&center=true&vCenter=true&width=500&height=100&lines=I+am+Hud+Azamov;I+am+Mobile+Developer;Hello+LeetCode;Mobile+Programmer;I+am+from+Uzbekistan;My+best+code+Kotlin;\uD83C\uDF31+I\u2019m+currently+learning+Flutter;\uD83D\uDC6F+I\u2019m+looking+to+collaborate+with+other+content+creators"></a>\n</p>\n\n![image](https://assets.leetcode.com/users/images/6ecdad44-4d8e-4ce3-9df0-d277a116d425_1661696491.5766337.png)\n\n# C++ Solution\n```\nclass Solution {\npublic:\n    int smallestEqual(vector<int>& nums) {\n        // i mod 10 == nums[i]\n        for(int i=0;i<nums.size();i++)\n            if(i%10 == nums[i]) return i;\n        return -1;\n    }\n};\n```\n\n\n# Java Solution\n```\nclass Solution {\n    public int smallestEqual(int[] nums) {\n        for (int i = 0; i < nums.length; i++) {\n            if (nums[i] == i % 10) {\n                return i;\n            }\n        }\n        return -1;\n    }\n}\n```\n
['Java']