L23. Merge two sorted Linked Lists

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


Please do give us a like, and subscribe to us if you are new to our channel.

Рекомендации по теме
Комментарии
Автор

Bro woke up and dropped the whole playlist

shubhambhatt
Автор

Definittely this is one of the best playlist on linked list in youtube.

ashwaniagrawal
Автор

best series i have ever seen especially the dry run thank u so much for an exceptional series

SaiSumanthKovuru
Автор

Striver made the solution as cake walk... best teacher !!

braj_marg
Автор

Byfar the best linked list series
Thank you very much Raj Bhaiya

neerkhandor
Автор

Great video, -->
This video is not updated in the SDE sheet and in the Article as well.

ShivamRajput
Автор

dude you're better than that neetcode guy thank <3

Mel-upun
Автор

we missed youuu here ! KEEP UP THE GREAT WORK YOU'RE DOIN MAN

jnayehsirine
Автор

Bhaiya, I can definitely say, you are god of DSA❤❤

robot.
Автор

Thanks for clean code. sudo code have minor issue, please correct it . if ( t1 -> data < t2 -> data ) You missed equal elements . it should be if ( t1 -> data <= t2 -> data )

amarpalji
Автор

meri tarf se ik papii supper good explanation

sohamsonwane
Автор

Bhaiya when can we expect stack queue playlist

itsd
Автор

why this problem is not in the A2Z sheet?

rajatraj
Автор

Lecture successfully completed on 30/11/2024 🔥🔥

PCCOERCoder
Автор

optimized at 6:26. similar to merge operation

m_fi
Автор

letsss fuckin did both the approaches by only just getting one hint and last handling of edge case where i is not null where i tell temp ki tera next is i and vice versa yaaay

OmkarKudalkar
Автор

8:15 Can anyone tell in which video dummy node concrpt is explained by him😅

atulwadhwa
Автор

class Solution {
public ListNode mergeTwoShortedLists(ListNode l1, ListNode l2){
ListNode ans=new ListNode(-1);
ListNode temp=ans;
while(l1!=null&&l2!=null){
if(l1.val<=l2.val){
temp.next=l1;
l1=l1.next;
}else{
temp.next =l2;
l2=l2.next;
}
temp =temp.next;
}
if(l1==null)
temp.next =l2;
else
temp.next=l1;
return ans.next;
}
}

dayashankarlakhotia
Автор

shouldn't time complexity be min(n1, n2) coz this is where while stops and then it's just one extra link that we've to do?

atulwadhwa
Автор

On which topic you will be making your next playlist??

RAHULSINGH-cdgl