Valid test case found which is not in test set

A : [ 1, 4, 5, 8, 10 ]
B : [ 6, 9, 10 ]
C : [ 2, 3, 6, 10 ]

An input that requires all three pointers to go to the end, while 2 pointers have already reached the end, is not tested.
In this case B,C pointers would reach 10 first and then A’s pointer.

The problem’s tests were passing for my first correct submission. However, this test returned 1, while the answer is 0.


It is tested, my code returns 0 for your test case.
Even your code might but you’re interpreting it wrong. Because the pointer which is lower moves ahead. And not all at once, hence in your example the pointer of 1st and 3rd array would reach their last element while pointer of 2nd array stay at 10 itself. Hence, all possibilities are rectified.