LeetCode #21: Merge Two Sorted Lists (Visualization)

Показать описание

A step-by-step solution to #LeetCode question 21: Merge Two Sorted (Linked) Lists
0:00 Intro
0:15 Code Walkthrough
2:38 Shorthand "OR" explanation

#coding #programming #algorithms

Рекомендации по теме

Комментарии

Takes a lot of effort to explain a complex problem in a clear way. This was super clear and easy to understand. Thank you!

govindrai

Great explanation! I usually don't comment on YouTube videos but this is the first video explaining the problem that actually made it easy for me to understand. Thanks!

ytrg

Your videos always make me smile, thank you for brightening my day!

MyCodingDiary

Well explained! I always like your video!

andygo

That was awesome, as this was my first time solving any linked list problem so this diagrammatical representation of every line made my concept crystal clear. Thank you!!

proteansan

thank you! a simple and intuitive explanation.

guna

Algo Engine slaying another leetcode problem. Thank you for explaining concepts clearly, something our professor can't do.

youtubeweb

спасибо за помощь, очень классное видео

мишаиосько

you're the goat, keep up these videos

RANDOMGUYPRODUCTIONSS

I'm confused about node.

1. head = ListNode()
current = head # does this mean current = ListNode()?
head and current should look like this?
head [0, None]
current [0, None]

2. if list1.val < list2.val:
current.next = list1 # does this mean head.next = list1 too?
list1 = list1.next
then head [0, 1], current [0, 1]?

3. then the next iteration they will look like this right?
head [0, 1] -> [1, 2]
current [1, 2]
why current aren't the same as head anymore I thought any change made to current would apply to head too.

exab

My issue is with “current = head”, doesn’t that mean a current is a new variable that contains the same thing as head? How is it now a pointer that when manipulated, it now also affects the head? It doesn’t make sense why you return head.next, when all the pointer manipulation has been done to current, or is there a way linked lists work that I am not aware of? Nice video btw

dnm

Hey! Thank you for your video. I liked it! I have one question (or two).
In the video, when current is moving, you show that the old arrow from list1 or list2 changes its position towards current. But it doesn't really go away, right? Or do we change the original list1 and list2, and unused arrows (refs) are deleted by garbage collector?

syuo

Make more vids on stack, queues, trees, graphs QS.

SimranMallar

Please complete the entire Blind 75 series.

ameyaraj

list1 = [1, 2, 4]
list2 = [1, 3, 4]
class s:
def mergeTwoLists(self, list1, list2):
l= list1 + list2
l.sort()
return l
a=s()
a.mergeTwoLists(list1, list2)

abhi-btwj

I am a code self-learning beginner. Sorry for asking stupid questions.

I am pleased to ask that
1. why we can type'' list1.val'' without setting ''variable = ListNode()''?
2. why ''list1.val'' is pointing to the first interger in list1 instead of the hole list?

chichungwan

Hi, great video! Is it assumed that in these types of problems you are allowed to reference nodes from the input lists instead of creating new ones? My concern is that if someone in the future mutates one of the inputs it will also mutate the merged list

Роман-дьц

thank you for explanation! by the way how does the actual input looks like? when I try to call function using list1 and list2 (providing as a list) it throws error I suppose this is not the way to input lists (or arrays whatever) but leetcode gives the impression as if they give as a list. like this:

Input
list1 =
[1, 2, 4]
list2 =
[1, 3, 4]
Output
[1, 1, 2, 3, 4, 4]
Expected
[1, 1, 2, 3, 4, 4]

why do we do current.next = list1/list2 instead of current = list1/list2?

jeffreyalidochair

Very nice video! Thanks for sharing! One question. Shouldn't the value of head node be 0 instead of None?

alimehdizadeh

LeetCode #21: Merge Two Sorted Lists (Visualization)

Merge Two Sorted Lists - Leetcode 21 - Python

LeetCode #21: Merge Two Sorted Lists (Visualization)

Merge Two Sorted Lists - LeetCode 21 - JavaScript

Merge Two Sorted Lists | Live Coding with Explanation | Leetcode #21

LeetCode 21: Merge Two Sorted Lists RECURSIVELY - Interview Prep Ep 62

Merge Two Sorted Lists - Leet Code 21 - TypeScript

LeetCode 21 Merge Two Sorted Lists in javascript

Google Coding Interview Question - Merge Two Sorted Lists - Leetcode 21

Easy Linked List Question! | Merge Two Sorted Lists - Leetcode 21

Efficiently Merge Two Sorted Lists in JavaScript | LeetCode 21

Merge Two Sorted Linked Lists (LeetCode 21) | Full solution with Examples | Study Algorithms

LeetCode 21: Merge Two Sorted Lists ITERATIVELY - Interview Prep Ep 61

Leetcode 21. merge two sorted lists

LeetCode Merge Two Sorted Lists Solution Explained - Java

LeetCode #21 Merge Two Sorted Lists - Python

Merge Two Sorted Lists | LeetCode 21 | C++, Java, Python

Leetcode - 21 Merge Two Sorted Lists (EASY) in Python | Java | Coding Sensei

Leetcode 21. Merge Two Sorted Lists (Python)

LeetCode 21 - Merge Two Sorted Lists Solution - C++

LeetCode 21 - Merge Two Sorted Lists

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

LeetCode 21 - Merge Two Sorted Lists - Kotlin

Leetcode | 21. Merge Two Sorted Lists | Easy | Java Solution

LeetCode: 21. Merge Two Sorted Lists (Golang & Java)