Missing Test Case - 3550. Smallest Index With Digit Sum Equal to Index

[Sanjeevan76]

LeetCode Username

samleetcode76

Problem Number, Title, and Link

3550. Smallest Index With Digit Sum Equal to Index

Bug Category

Incorrect test case (Output of test case is incorrect as per the problem statement)

Bug Description

my code giving right answer but it is showing wrong .code give below

Language Used for Code

C++

Code used for Submit/Run operation

class Solution {
public:
    int smallestIndex(vector<int>& nums) {
        int n=nums.size();
        unordered_map<int,int>mp;
        for(int i=0;i<n;i++)
        {
          string s= to_string(nums[i]);
          int x=s.size();
           int sum=0;
            for(int j=0;j<x;j++)
            {
                sum+=s[j]-'0';
            }
            mp[i]=sum;
        }   

        for(auto &pair:mp)
        {
            if(pair.first==pair.second)
            {
                return pair.first;
            }
        }
        return -1;
    }
};

Expected behavior

expecte output for test case nums =[1,10,11] is 1 ,my code also gives 1 but it is showing 2

Screenshots

No response

Additional context

No response

[wktang]

oj-leetcode commented: Hello,

Your reported issue has been relayed to our team for thorough investigation. We appreciate your patience as we work to address and resolve this matter. We will reach out to you when we have updates regarding the issue.

If you have any further questions or concerns in the meantime, please feel free to let us know.

Best regards,
LeetCode Support Team

[wktang]

Epiphania_Ekenimoh commented: Hi there,

Thank you for taking the time to share your feedback with us.

After careful consideration, we have decided not to move forward with the changes suggested in your feedback.

Please know that your input is important to us. Your continued feedback is greatly appreciated as we work towards improving our platform.

Best regards,
LeetCode Support Team