Linear Search || O(N) time || O(1) space
\n\n# Code\n\nclass Solution {\npublic:\n    int smallestEqual(vector<int>& nums) {\n        int val=-1;\n        for(int i=0;i<nums.size();i++){\n            i
\n\n# Code\n```\nclass Solution {\npublic:\n    int smallestEqual(vector<int>& nums) {\n        int val=-1;\n        for(int i=0;i<nums.size();i++){\n            if(i%10==nums[i])return i;\n        }\n        return val;\n        \n    }\n};\n```
['C++']