Merge Two Sorted Lists - Leetcode 21 - Linked Lists (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@BilalTroll]

This is the only explanation that makes sense, I prefer this over the neetcode video.

[@GregHogg]

Glad to hear it!!

[@Fam-m4i]

Neetcode sucks man . I get bored watching his videos

[@akshatsingh9830]

a issue which might be either me or bcom someone elses problem in ur c++ solution : correc the dummy node initialization ListNode*dummy = new ListNode(0) , this works everytime and doesnt produces error

[@yvettcodes]

your videos are always so clear and helpful! thank you!

[@itsurabhi506]

loved the explanation i've watched other videos where they created a new list and just added the values in sorted order changing the pointers is what was asked here Thank you very much

[@GregHogg]

No problem!

[@darshanamohanan6101]

Thank you so much.This was really easy to understand.

[@AmanjotSingh-rj7ox]

thanks greg, i was not able to understand how its O(1) space until i saw your whiteboarding

[@abhishekgeorge8626]

can u explain me who it is o(1) im also confused

[@creatorsstudio9]

can't thank you enough gregg !!!!

[@christianjt7018]

Very clean solution, thanks a lot!

[@GregHogg]

Thank you!

[@Everafterbreak_]

really good explanation bro!

[@pound9799]

HOW IS THAT AN EASY QUESTION

[@prathameshpatankar1864]

You made it easy to understand. Nicely explained.

[@GregHogg]

Glad to hear it!

[@软件实验室]

Really clear explanation, thank you so much! keep up the good work

[@GregHogg]

Very glad to hear it! Thanks so much :)

[@samfromuk796]

Love the explanation

[@mroafish]

What would a solution look like if we were asked to create a new node and then add it to our linked list? I am trying to implement that but i am struggling

[@chuckyyys]

def mergeTwoLists(self, list1, list2): cur1, cur2 = list1, list2 # dummy node cur3 = l3 = ListNode() while(cur1 and cur2): # link current (of result list) to the new node cur3.next = ListNode() # move current to the new node cur3 = cur3.next # compare values if (cur1.val

[@ECO720Hunter]

Thank you for the explanation. Very clear and neat. I'm a python-virgin and have two trivial questions 1. how do you test the code? I've written a code and test it on leetcode and it's fine but when running on python, I can't test it and got error! 2. Why do you insert # behind ListNode class? if it is excluded from the code how does the remaining part of the code work?

[@GregHogg]

Good question. Basically leetcode puts the class in a hashtag for readability. But the class is actually necessary. It's leetcode being weird

[@stringjourney]

Crisp and clear

[@GregHogg]

Super glad to hear it!!

[@tayyabkhan1139]

i am getting tle error

[@davea136]

MergeSort, essentially.