Merging two sorted linked list

#1

My code is passing only 1 test case. Can you please help me find the mistake.

#2

n1, n2 can be zero as well. But your code is always creating a linked list of 1 element before, irrespective of the size. Also, try to merge the two sorted linked lists recursively.

1 Like
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.