Definittely this is one of the best playlist on linked list in youtube.
@SaiSumanthKovuru10 ай бұрын
best series i have ever seen especially the dry run thank u so much for an exceptional series
@393ShivamRajput9 ай бұрын
Great video, --> This video is not updated in the SDE sheet and in the Article as well.
@neerkhandor500710 ай бұрын
Byfar the best linked list series Thank you very much Raj Bhaiya
@amarpalji8 ай бұрын
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 data )
@anirudhv00626 ай бұрын
yes. I wondered the same. I came here from leetcode. there some values in the two sorted lists which are same. but what an explanation. I know only basics of linked lists. I was able to undersand well enough
@ujjwalsingh68896 ай бұрын
There is no need for this Equal to condition bcz it already handled by else part But it is good to think about this condition👍👍
@anirudhv00626 ай бұрын
@@ujjwalsingh6889 yes. I realized it later. when I did a dry run. Thanks for replying ujjwal
@rahulmandal40074 ай бұрын
@@anirudhv0062 You need to improve your DSA These are basics
@jnayehsirine62227 ай бұрын
we missed youuu here ! KEEP UP THE GREAT WORK YOU'RE DOIN MAN
@robot3.0779 ай бұрын
Bhaiya ,I can definitely say, you are god of DSA❤❤
@sohamsonwane15349 ай бұрын
meri tarf se ik papii supper good explanation
@OrderEmperor9 ай бұрын
🏳️🌈
@kirannaik44175 күн бұрын
Loved it, bro!
@itsd238810 ай бұрын
Bhaiya when can we expect stack queue playlist
@rajatraj42974 ай бұрын
why this problem is not in the A2Z sheet?
@rajatshukla260512 күн бұрын
Understood!
@Bhawna-ir1gr10 ай бұрын
amazing explanation ✨✨
@ManojKumar-do1rh7 ай бұрын
Thanks ... nice explaination
@crazyfacts44349 ай бұрын
Very good explanation. 😊😊
@dayashankarlakhotia494310 ай бұрын
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
@aakashbhandari976110 ай бұрын
Welcome Back sir❤🎉
@RAHULSINGH-cd6gl9 ай бұрын
On which topic you will be making your next playlist??
@atulwadhwa1928 ай бұрын
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?
@shahidullahmuffakir6686 ай бұрын
if the smaller values were in the n2 then in this case we will traverse till the end of n2. so min(n1,n2) will not work.
@hashcodez7573 ай бұрын
Epic bhaiya!!
@DeadPoolx1712Ай бұрын
UNDERSTOOD;
@sujalsingh936510 ай бұрын
Happy New Year 🎉
@YourCodeVerse9 ай бұрын
Understood✅🔥🔥
@ddevarapaga51343 ай бұрын
Best bhai Thank you
@samriddhichoubey783229 күн бұрын
In which lec you've explained the concept of dummy nodee?
@subee12810 ай бұрын
Thanks
@adebisisheriff1598 ай бұрын
Thanks Striver!!1
@d.praful4 ай бұрын
Nice explanation ❤
@justsomeguywithoutamustach99784 ай бұрын
To be exact, time complexity would be O(min(n1 + n2)).
@ArpanChakraborty-do6yz7 ай бұрын
Awesome 😎 17:36
@m1stnoob2014 ай бұрын
Can't we use dummy node to make it as a copy of the lowest head value of either of the lists (which acts as the head of the new merged list) , and repeat the same process . Will the solution be different ?
@NARUTOUZUMAKI-bk4nx9 ай бұрын
Understoood
@himanshidafouty3474 ай бұрын
Understood
@VibhaJamadagni-hz6ck4 ай бұрын
understood
@abhishekprasad0105 ай бұрын
What if I use a multiset instead of an array in brute force approach??
@nayankhuman1043Ай бұрын
understood :)
@musabahmed5677 ай бұрын
I'm confused how the space complexity is O(1)? We are creating a dummy node which extends to hold the nodes of both linked list 1 and linked list 2. Don't the space complexity be O(n1+n2) where n1 are number of nodes in linked list 1 and n2 are number of nodes in linked list 2.
@gulugulu-pw2ds6 ай бұрын
ACTUALLY ITS LIKE VARIABLE DECLARATION .
@aneeketvispute50633 ай бұрын
we are not creating a new node we are just declaring it like a temp node
@karthikeyan.s25652 ай бұрын
@@aneeketvispute5063bro If we change temp.next = t2 then how the next node of t1 is not lost Since we're changing the link
@No-yp1uv2 ай бұрын
is this a dynamic programming problem?
@cenacr0076 ай бұрын
I couldn't find this question in the a2z playlist.
@atulwadhwa1928 ай бұрын
8:15 Can anyone tell in which video dummy node concrpt is explained by him😅
@codeman38288 ай бұрын
Undertsood
@ashishpradhan62504 ай бұрын
Nyc
@YashGaneriwal-je6rh2 ай бұрын
done and dusted
@OmkarKudalkar10 күн бұрын
letsss fuckin gooooooo 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
@nashratjahan93719 ай бұрын
There's a little mistake at the end for handling remaining nodes after either one list has reached null, there should be a another while loop to handle those cases. Also there isn't a java code to the above problem kindly provide one
@gokulanvs9 ай бұрын
No need for while loop , see the video 11:40
@md.ualiurrahmanrahat24009 ай бұрын
No,we don't need the while loop here. As we are using the exiting nodes itself,not creating new ones. Suppose n1 is null, so n2 is left. we pointed temp->next as n2. so, from here, link is maintained up to n2 becomes null. Hope you got this.
@pratiushkumar33068 ай бұрын
Wait what 😂 he did solved that with if else. Watch it completely before commenting.
@rahulhembram45199 ай бұрын
UnderStood
@ShivaMahajan078 ай бұрын
God or what
@AkashKumarTiwary-u4b5 ай бұрын
god
@Adarsh_agrahari9 ай бұрын
Done and dusted😅
@aayushgakhar35256 ай бұрын
free(dummy node):
@cenacr0076 ай бұрын
us
@rahulmandal40074 ай бұрын
where the hell is the dummy node concept been spending hours to find but couldn't find it Someone plz pin it