@ianokay
It's wild how good this format is for this content
@giorgikalandadze9263
Shorts are great. Keep going 🎉
@gorakhborude447
We need more shorts .. saves hours
@thegamestand163
Like merge sort
@kahilopedro-speedcuber5192
Is it the same logic behind merge?
@deepakvenkatesh5166
In Common Lisp (sort (append list1 list2) #’<)
@Supakills101
Don't call me a dummy!
@zhuohongjacksonchen7033
In the first line of the solution, why do we need dummy instead of just node = ListNode( ) and return node?
@lots_of_codeswallop
Why all that? I think we can just merge the arrays using a spread operator and then sort it. Done
@activetutorial
Actually intuitive solution: convert both to array, sort, convert back to linked list.
@humblecoder070
Cool thanks for posting
@lightcrystals34
can we use a map in c++?
@darknight3613
Why do we need dummy and why return dummy.next?
@Flyhigh24162
but this solution is not optimal 38ms!!??
@xarcos398
I hate python's implicit conversion. How do you assess a freaking list as true or false. Just cannot mentally grasp this
@Shagidelic
Yes. This is merge sort algo. Next level would be to sort it in-place, meaning without creating a new array or linked list, instead, sort it in one of the list by rearranging.
@noextrasugar
I don’t understand this, what the first line with dummy does? Are we creating extra linkedlist to make the sorted LL?
@kanishksingh5146
This code only works if both lists are of equal length. In case if one list is longer than the other, we’ll need another loop to add all remaining nodes from the longer list
@thiagosdev
Pointers!
@jnayehsirine6222