Lecture 49: Merge 2 Sorted Linked Lists || Sort 0s, 1s and 2s in Linked List

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

In this Video, we are going to solve important questions based on Linked List.

There is a lot to learn, Keep in mind “ Mnn bhot karega k chor yrr apne se nahi hoga ya maza nahi aara, Just ask 1 question “ Why I started ? “

Questions Links:

Do provide you feedback in the comments, we are going to make it best collectively.

Connect with me here:

Telegram Group Link: Love Babbar CODE HELP

Intro Sequence: We have bought all the required Licenses of the Audio, Video & Animation used.

Timestamps:

00:00 - Question 1
01:45 - Promotion
02:55 - Approach #1
05:04 - Code Approach #1
08:37 - Approach #2
13:00 - Code Approach #2
27:00 - Question 2
28:48 - Approach
34:57 - Code Approach

#DSABusted #LoveBabbar

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

Комментарии

Babbar bhaiyya... I love you... Koii apna bhi itna help nhi karta jitna aap kar rhe ho.... Bhagwan aapko meri ummar bhi de de... Legend and GOAT....

fgh

Glad I have completed 1/3 of the series, and still continuing.

yashsonune

Bhaiya 1 month me (1- 49 )lecture 😍 what a course..

iamvishnuranjan

BOTH Questions have unique concepts and bhaiya explain it very well, Thanks bhaiya.

tjstar

I coded the 2nd one merge two sorted array by myself. i looked at ur approach discussion and did by myself. thanks for the giving me the confidence

harshitkumar

Wahhh bhaiya 💥😃😃
DSA ki ab Video na dekhu to din productive nhi lagta 😃

Bhaiya plz *"5 Month Internship Strategy Series lao with DSA busted course as resource"* (for 2nd year students)🥺

unboxtheuniverse

Your teaching and your explanations are absolutely exceptional!!!

yashparalikar

Thank you so much for your lovely videos, you really make understanding the concepts a cakewalk!
Glad to be your student.

devanshusahoo

to check for the case when both elements have one one element, instead of adding a new if condition at beginning, we can also move the "if (next1==NULL)" condition outside the while loop, then also answer is correct, hope this helps.

RajveerKaur-zell

at 41:15 while inserting a node between two nodes we can use :
curr1->next=curr2;
curr2=curr2->next;
curr1=curr1->next;
curr1->next=next2;

and also why we are checking for next1->data >curr2->data > curr1->data
we could just check with next1 only
as we know we start with element with smallest value any value will be greater than or equal from starting node
and then going further in list if curr2 is inserted and then new curr2 value will definitely greater than previous one

Anmol-hz

Can't believe that someone dislike this video ! 🙂 💔
If you buy a course which takes from you 20k that course never give you that kind of explanation .
Love from Kolkata ❤️🙌

tusharmukherjeeju-cse

thanks bhaiya for bringing all such good questions in this course and hats off to your efforts...aap itne busy hoke bhi regular videos daal rhe ho isse motivation milta hai ki chahe kitne bhi busy rhe humlog cllg exams me tb bhi hum pdhai krre... Thanks bhaiya...Keep smiling bhaiya bht suit krta hai aaapar..

Roshanhoro

20:00
We can Simply Handle it by using this steps
p3->next=NULL;
p2->next=twoHead->next;
p1->next=oneHead->next;

priyanshpatel

35:00 Explanation was just amazing, thank you so much!

durgashreenv

at 55:44, i think we don't need to add extra case when there is only one element in list one instead what we can do is - we can simply write that condition of
if(next1== NULL and curr2 != NULL){
curr1 -> next = curr2;
}

it will take care of case at 55:44 as well as previous case when first list finish and second list still has some element

and please feel free to to correct me if i am wrong,

anmolkumar