# Test case missing

• My very first practice code involved converting each list to a long number and adding them and converting it back to list and returning. Basically two function list2num and num2list. It worked, and my solution got accepted too. However, when I tried with following input, my solution failed. So, I think another test case can be added here:

[2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,9]
[5,6,4,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,2,4,3,9,9,9,9]

It is basically a test for very long numbers. Please see if you think it is a good edge case. Thanks

• Oh wow... you're right, all numbers in the whole test suite have just 10 or fewer digits. Very weak.

• Please excuse me, as this is one of the earliest questions added in OJ and the test case is indeed weak. I have added your test case, thanks!

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.