✅ [C++] EASY and Shorter Solution || Intuitive Approach
\n\n# Complexity\n- Time complexity:\nO(N)\n\n- Space complexity:\nO(1)\n\n# Code\n\nclass Solution {\npublic:\n    int smallestEqual(vector<int>& nums) {\n\n  
\n\n# Complexity\n- Time complexity:\nO(N)\n\n- Space complexity:\nO(1)\n\n# Code\n```\nclass Solution {\npublic:\n    int smallestEqual(vector<int>& nums) {\n\n        int i,n = nums.size();\n        int value=0;\n        int f=0;\n\n        for(i=0;i<n;i++)\n        {\n            value = i%10;\n            if(value==nums[i])\n            {\n                f=1;\n                break;\n            }\n        }\n        if(f==1)\n        return i;\n        else\n        return -1;\n        \n    }\n};\n```
['C++']