Missing Test Case - 1367. Linked List in Binary Tree

[MQuang200]

LeetCode Username

MQuang200

Problem Number, Title, and Link

1367. Linked List in Binary Tree https://leetcode.com/problems/linked-list-in-binary-tree/

Bug Category

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

Bug Description

For the test case with ListNode = [3,2] and TreeNode = [1,3,null,null,3,null,1,null,2]. The right output is false, but the current accepted solution's output is true

Language Used for Code

Java

Code used for Submit/Run operation

class Solution {
    public boolean isSubPath(ListNode head, TreeNode root) {
        return dfs(head, head, root);        
    }

    private boolean dfs(ListNode head, ListNode cur, TreeNode root) {
        if (cur == null) {
            return true;
        }

        if (root == null) {
            return false;
        }

        if (root.val == cur.val) {
            cur = cur.next;
        } else if (root.val == head.val) {
            head = head.next;
        } else {
            cur = head;
        }

        return dfs(head, cur, root.left) || dfs(head, cur, root.right);
    }
}

Expected behavior

The output should be false instead of right for an accepted solution

Screenshots

Additional context

No response

[exalate-issue-sync]

LeetCode Support 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 at this time.

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