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

[ankur1082]

LeetCode Username

ankur1082

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

I found a bug in a contest question when I submit my code it passed all the test cases but when I write
My custom Testcase - [0,1,2,1,2] it give wrong output acc to my code even after passing all leetcode testcases
Output - 0(according to my code)
Expected - 4

Language Used for Code

Java

Code used for Submit/Run operation

class Solution {
    public int longestSubsequence(int[] nums) {
        int xor = 0;
        for(int num : nums) {
            xor ^= num;
        }
        if(xor != 0) return nums.length;
        if((xor ^ nums[0]) != 0) return nums.length - 1;
        return 0;
    }
}

Expected behavior

My custom Testcase - [0,1,2,1,2]
Output - 0
Expected - 4

Screenshots

Additional context

No response

[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: Hello there,

Thanks for your patience!

The issue you reported has been resolved. Please feel free to verify and retry.

We apologize for any inconvenience this may have caused and appreciate your patience while we worked to resolve the issue. If you have any further questions or concerns, please do not hesitate to contact us.

Thank you,
LeetCode Support Team