Merge two sorted Linked Lists to form a new Sorted Linked List

[@kundankarma5707]

You explain every problem in a very simple way. I appreciate your teaching

[@lindawisebear]

Absolutely brilliant tutorial; one of the best I've seen on youtube for linkedlists!

[@vivekanandkhyade]

Thanks Linda..!

[@panagiotiskoligas9631]

if you like watch my tutorial about linked lists in c:linked lists c by panagiotis koligas.

[@lavender_artistic_05]

Do I have to put header file and main function before the program in exam

[@adarsh.singh.777]

I tried my ass out to solve this problem until I found this video, I was just missing a trick. thanks a lot man..you're amazing.

[@sushantshirsekar1443]

Simplicity level to infinite, great respect sir.

[@osamamughal2707]

This is the best and the simplest explaination and approach of this problem. Really find this wonderful video after searching and didn't regreted a setting, Very nice Explaination Thankyou very much.

[@F_and_L]

thank you sir.u have explained in a very easy way that even a non tech person also can understand.thank you again sir

[@adityabhosale8461]

This is the best tutorial you'll get on KZbin..

[@sivaramchintalapudi5216]

After searching lot of videos, finally landed at right place.

[@vishesharora3984]

Brilliant explanation. Thanks a lot sir. You made such a hard problem so easy.

[@jayeshvyas6390]

Thank you so much i was stuck by this problem but after seeing your explanation now i can easily understand .

[@percyygaming]

Sir i like your explanatory skill as you teach in very easy language!

[@asim-gandu-phenchod]

Brilliant. Much respect from Pakistan

[@namrataswain7999]

Amazing tutorial Sir. So simple and easy to understand.

[@explorewithshobhit9157]

Extremely Satisfying video. Made easy by ( narshima karumanchi ). Has all the problems that you discussed on your videos. Thank you 🙏keep going 🦅

[@ayushshukla1597]

Thanks a lot Sir. You're a gem.

[@vivekanandkhyade]

Glad it helped

[@muhammadtahakhan1833]

Best Explanation indeed. Love From Pakistan

[@gauravsinha5830]

Great help. However, I don't think you would need the first if(p && q) check. It will only reach there if that case prevailed.

[@sumitchakraborty9451]

best teacher award goes to Vivekanand sir

[@satyamsharma5181]

Awesome concepts And awesome teacher .

[@adithiyagurupatham3255]

It's really a nice video and I really understood the concept thanks sir!!!

[@pinkeshpatel1940]

Great way to explain the linked list.

[@rishabhsahu5257]

Love your work and efforts bro.!!.Cheers to open source community

[@dishipratap5871]

thank u sir, your explanation helped me lots.

[@vivekanandkhyade]

thanks Dishi.

[@varunsakunia8945]

Very Nice explanation. i got better understanding of this concept.Thanks sir.

[@karun4663]

no words simple and clean explanation u deserve more views and subs

[@TechnicalBaniya]

write a code to partition a linked list around a value x such that all nodes less than x come before all nodes greater than or equal to x. if x is contained within the list , the values of x only need to be after the elements less than x. the partition element x can appear anywhere in the right partition it does not need to appear between the left and right partitions. input:. 3->5->8->5->10->2->1(partition 5) output: 3->1->2->10->5->5->8

[@TechnicalBaniya]

sir please make the video on it actually even I didn't understand the problem

[@holyshit922]

This can be written quite easily if we know how to write a queue but here we dont care about allocating memory Dequeue element from the original linked list Compare key values of dequeued node and pivot node Enqueue dequeued node to the correct sublist Repeat these steps until original list is not empty Lastly sublists can be concatenated If order of nodes with keys equal to pivot key does matter use three sublists First contains nodes less than pivot Second contains nodes equal to pivot Third contains nodes greater than pivot otherwise two sublists will be enough For queue operations and concatenation each list should have pointers to the head node and tail node

[@-_-sweetvibes-_-]

*Return newhead should be written outside the while loop..else it will be returned in first iteration only...*

[@h3is3nb3rg]

An Awesome Tutorial explained in lucid language. Thanks a lot !!!

[@AnilKumar-qy5tf]

watch this for better understanding kzbin.info/www/bejne/oae2iGecdrKXsLM

[@alone_man3198]

Brilliantly explained

[@vivekanandkhyade]

Thanks a lot Aman

[@yamotuki]

great! I refer this video for solving leetCode problem.

[@sriramkukkadapu1049]

Thanks Vivekanand. Good video :) i tried this and it worked perfectly.

[@akshaygodase8067]

bro. You explained it really well. Awesome keep it up!

[@harshraj57]

Amazing sir...i have cleared my concept easily thank u sir

[@vaibhavgupta1519]

Thank you so much for this elaborated point wise explanation

[@deekshithpranav1619]

bro we need merge sort with linked list c++!! its a very improtant algo and useful in placement interviews.

[@collinsmuriuki2566]

Thanks, very well explained.

[@tegharomeo]

love your explaination sir

[@nayanpandule9779]

Thank you very much Sir for the amazing explanation..!! I really appreciate it

[@abinashbarik5128]

Hi Sir, I used to see your videos .Your videos are very very useful for me . I want a video on Flatten a Sorted multilevel linked list and Sort a linked list of 0s, 1s and 2s .Sir Kindly upload upload these videos.

[@pulkitsupple6148]

Well explained 👍👍

[@rohitdixit1617]

You my friend are a RockStar!

[@AdityaKumar-ws5pv]

sir u are doing gr8 job.Please keep uploading videos.Thank u

[@vivekanandkhyade]

Thanks Aditya..!

[@harshitmaurya9140]

Great explanation sir

[@varunnarayanan8720]

Very well explained sir Thanks

[@samyakjain3397]

sir ur videos really helped us alot tysm

[@priyashrivastava5943]

Amazing explanation

[@GANESHKUMAR-dm5if]

Great explanation sir really great ...

[@danillomelodafonseca]

Thanks, you saved me 😢❤

[@SatyendraJaiswalsattu]

very good explanation sir..

[@holyshit922]

Both linked lists and files have sequential access so we can adapt file sorting algorithms for sorting linked lists

[@CSFGIRIBAABUKG]

extraordinary

[@r3fl3xplays36]

these topics are not available on youtube.

[@nikhilchopra5512]

very well explained thx a lot

[@harikhakolipaka9197]

Wow finally I understood.Thank you sir.

[@reyou7]

Amazing->next = amazing!

[@ishan_kumar]

Factorial hatao bey

[@francobarbosaflores7773]

congratulations, very good!

[@Kchima85]

I apologize if I am incorrect about this, but I was confused about one particular part of this code. When you save newHead = sorting; is that backwards? Should it not be sorting = newHead?

[@vivekanandkhyade]

we are assigning the 'sorting' node address to the newHead variable...so newHead = sorting . See if we do " sorting = newHead" , then at this time newHead is Null so sorting will also become Null. So that is not correct. The current address of "sorting" node is the starting address of our answer linked list , so newHead = sorting. Once we save the address in newHead , now "sorting" variable is free to move further.

[@Kchima85]

Vivekanand Khyade - Algorithm Every Day I see where our code differs. I assigned the lesser of the two nodes in the initial comparison to newHead. Then when I assigned the sorting to the newHead it set newHead back to null. That is why I am incorrect.

[@dighechinmayt]

clear and concise explanation, thank you!

[@meghamou456]

Very nicely explained, thank you!

[@prachichandrakar2367]

thank you so much for this video it helps me a lot

[@vivekanandkhyade]

Thanks Prachi..!

[@sreelakshmig4004]

So using if-else condition we're sorting and merging the two already sorted linked lists and using while loop were printing the newly merged single sorted linked list?Amazing explanation sir.

[@dannfrank6613]

no using the if statement at the beginning we can set the head of the list then using the while loop we can set the rest of the list starting at the head.

[@tevaganthanveluppillai720]

Very well explained. thanks.

[@mahanteshnayakar2227]

Really good explanation, keep it up.....

[@sankaranarayananh7957]

Nice explanation sir!

[@talibkhan9193]

Mindblowing explanation . Can we write this program for WAP merge of two sorted list ?

[@sayedathar2507]

Thanks Alot Nice Explanation.

[@piterbajk]

superb clear explanation, thanks! ;)

[@dhavalparikh333]

Good explanation. But the algorithm doesn't handle the edge case when one of the lists or both the lists has only one node in it.

[@ravishankarkumar106]

what a wonderfull explanation

[@Ozneroc]

Great video. I have a question: what if the list was doubly linked, where would the prev point?

[@richagupta1865]

What ll be the best and worst case complexity for this??

[@punitpawar4231]

Will it be possible for you to show the recursive approach of doing this operation ?

[@bharathSPS1995]

Thanks a lot! Really helpful

[@holyshit922]

I would write sorting pointer as local inside function There is missing function which divides list into two sublists and recursive or iterative sorting function How to make this algorithm to work for doubly linked lists To find a midpoint we can use two pointers slow goes once per iteration , fast goes twice per iteration in doubly linked lists we can iterate pointers from both head and tail When we find the midpoid we break the linked list into two sublists Sorting function is similar to this which works for arrays

[@vivekanandkhyade]

Thanks Jacek...will upload a video in Jacek..!

[@holyshit922]

Natural version of merge sort do not need recursion You can show it If you complete merge sort algorithm we will be able to use linked list for convex hull

[@holyshit922]

Merge sort can be used for sorting files I found in spanish textbook for Pascal natural merge sort for files but i would like to watch version of merge sort with optimized I/O operation Suppose we have limited memory f.e 64kB

[@Gandhiboy]

Thank you so much ❤️

[@poojasakhare8760]

Thank you 🙇

[@sandeshrana7225]

Brilliant. Thanks

[@vivekanandkhyade]

You're welcome!

[@utkarshdandagavhal2878]

Thank you sir❤️

[@panagiotiskoligas9631]

another way of merging 2 linked lists: if p->datadata:insert(list,p->data); else insert(list,q->data); am i correct?please advise..!thanks.i built this program in my way and worked...

[@aaryanbudhirajamusic6874]

it is right but here you are creating a new list, in this tutorial it shows how to merge in the same list

[@randeepsiddhu]

float playbackSpeed = 1.0f; if (you know the logic) playbackSpeed = 1.50; else playbackSpeed = 1.25;

[@siddhartharaja9413]

👍 good one

[@gameplanner4110]

even 2x will work

[@pawandeepchor89]

Very good ... excellent 👍

[@yasim9435]

Is there a way of merging 3 sorted lists which is better than merging 2 lists at a time?

[@BensonMpapa]

What will the code be like when reversing? can we say if (p

[@Wh0NeedsFr1ends]

Im having trouble with Duplicate values existing in both lists. Also having trouble with null inputs.

[@SurinderKaur-vq6ti]

well explained , thanks sir

[@Menikungmu]

i love the you wrote "r"

[@AbhishekSharma-uh8pb]

what if our list is not sorted ?

[@t__--__t]

some advice. You should include your source file

[@najimali32]

Your explanation is really good , But code is lengthy you can use the same concept using recursion. Node sortedMerge(Node a, Node b) { Node temp=null; if(a==null) return b; else if(b==null) return a; if(a.data

[@alokkumarsingh579]

after this i m fan of recursion....a better solution

[@tdsfriends1577]

Very helpfull, Thx

[@sachinbhalla14]

Sir your videos are Great But why you do'not provide code ??

[@jpakash1999]

ide.geeksforgeeks.org/LfgR5Cn2wp

[@pravesh8187]

Grt video sir

[@bidsouravbest]

you are awesome sir!

[@bharathi80205]

Hi, this is really Awesome!! Could you pls provide the code in java

[@khoavouc3706]

Hi techer it helpfull

[@sambhumahato8320]

very nice..❤❤❤

[@rwnsaad9738]

Thank sooo much really helpful

[@amritpandher4955]

Sir why does this method ignore multiplicity. If two lists have the same number it only prints it once.

[@lalayadav866]

very nice sir,......

[@vivekanandkhyade]

Thanks LALA..!

[@vidyakamath8298]

i am new to algorithms ,just wanted to know can we solve this using queue where we compare the data from both the linkedlist and which is less we add that to queue ?Please let me know.