Easy solution C++
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\nFirst analyze the problem then in one for loop return i smallest index .\
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\nFirst analyze the problem then in one for loop return i smallest index .\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int smallestEqual(vector<int>& nums) {\n        int r=-1;\n        for(int i=0;i<nums.size();i++){\n           r= i % 10;\n           if(r == nums[i]){\n            return i;\n           }\n     }\n     return -1;\n    \n    }\n};\n```
['C++']