Missing Test Case - 3702. Longest Subsequence With Non-Zero Bitwise XOR

[AkiiSinghal]

LeetCode Username

AkiiSinghal

Problem Number, Title, and Link

https://leetcode.com/problems/longest-subsequence-with-non-zero-bitwise-xor/

Bug Category

Missing test case (Incorrect/Inefficient Code getting accepted because of missing test cases)

Bug Description

It has been solved by simple steps:

1. If all the elements are zero output should be zero.
2. If the XOR of all elements is non-zero, then size of array.
3. If the XOR of all elements is zero, then (size of array - 1).

If we have a test case like
[0,0,3,3,0,0,0]
It should return 4 as correct, but returning 6.

Language Used for Code

C++

Code used for Submit/Run operation

class Solution {
public:
    int longestSubsequence(vector<int>& nums) {
        int x = 0, res = nums.size();
        bool isAllZero = true;

        for(int n: nums) {
            x ^= n;
            if(n and isAllZero)
                isAllZero = false;
        }
        if(isAllZero)
            return 0;
        if(x)
            return res;
        return res-1;
    }
};

Expected behavior

Instead of returning size -1 when XOR is 0.
We should find the nearest non-zero element from both ends. And reduce the least number of elements (whichever is nearest to both ends) from the size of the array as a result.

Example:
Input: nums = [0,0,3,4,3,4,0,0,0]
Output: 6
Explanation: 3 is nearest to the left (3 element) and 4 is nearest to the right (4 element). Therefore, we reduce 3 elements from the size of the array, which will result in 6.

Screenshots

Additional context

No response

[KuhnMejia]

lol my issue was actually a duplicate.

[amcones-lc]

PTAL

[exalate-issue-sync]

oj-leetcode commented: Hello,

Thank you for contributing to LeetCode and submitting a missing test case. Upon review, we found that your provided test case did not cause your solution code to fail and it was Accepted as before. This indicates that your test case may not address the specific edge case or scenario needed to highlight the issue in your solution.

Here are the test cases you submitted:

Test case #1:

[0,0,3,3,0,0,0]

Test case #2:

[0,0,3,4,3,4,0,0,0]

We encourage you to review your code and consider other potential edge cases that might reveal the underlying problem. If you identify any additional test cases or have further questions, please feel free to reply to this message or open a new issue with us.

We appreciate your engagement and efforts in helping us enhance our platform.

Best regards,
LeetCode Support Team

[exalate-issue-sync]

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

[exalate-issue-sync]

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