Add Two Numbers (LeetCode 2) | Full solution with diagrams | EASIEST EVER | Study Algorithms

[@sharpblades117]

Just want to say, thank you for covering this in the clean format that you did, this made the video engaging. Keep up these amazing videos.

[@anujgupta1484]

you are truly a gem for DSA learners .

[@itkavyas.p6176]

i just started DSA as beginner after watching most of the solution your solution is very simple and easy please post more videos and support peoples ..... you earned the new subscriber

[@nikoo28]

thanks for the sub 😄

[@johncho9160]

i really enjoy your leetcode explanations with the dry run of the code. as somone prepping for interviews, youve helped me a lot. thankyou!!!

[@preetomadityapranoy429]

Thanks a lot for this simple and easy solution. I solved the problem but test case 1565 out of 1568 was my stuck point and after that, I found your video. Keep up the excellent work.

[@nikoo28]

Well done

[@sachinpawar2665]

Your leet code solutions are above the par and the explaination is the deadly combination

[@nikoo28]

So happy to hear that :)

[@JigCode]

This is the best and clearest explanation of a leetcode problem that I have ever seen !!!

[@gamersrock392]

i really appreciate you sharing solution and telling how converting linked list into integers then adding and then again converting into linked list method is inefficient as thats what came in my mind while first solving solution

[@nikoo28]

glad you found it helpful

[@PrashantKumar-fk8le]

This man explains Best of best on youtube,Huge Salute 👑👑👑👑

[@nikoo28]

so glad you feel this way.

[@naibgulam2336]

Really enjoyed this video! Been following your channel to learn how to solve leetcode questions and your videos and organization are super useful and well thought out. Keep it up!

[@nikoo28]

You're very welcome!

[@krishankantsaraswat2276]

00:02 Adding two numbers in linked list format with reversed order 01:39 Adding two reversed numbers represented as linked lists. 03:27 Handle zeros at the beginning of linked lists while adding numbers. 05:06 Carefully consider edge cases for adding large numbers and handling overflow. 06:45 Adding two numbers using pointers and carrying over. 08:23 Code implementation and algorithm explanation 10:02 Splitting out the sum and carry after adding two numbers 11:47 Understanding the time and space complexity of the solution Crafted by Merlin AI.

[@shubhanshusharma7457]

nice explanation, got understood the solution in one video of yours,despite searching others

[@nikoo28]

glad you found it helpful

[@EaseyourLifeBro]

You deserve many more subscribers 😃Concise and accurate explanation. No confusion, every point makes sense. Please keep up the good work. 👍

[@nikoo28]

Trying hard 😇

[@Bot__gam_ing]

bruh you are awesome not even get bored while watching thanks

[@bashlaev_ka]

Частично понимал перевод, но за счет очень классного визуального объяснения понял объясняемый алгоритм. Круто, спасибо, было интересно

[@nikoo28]

Я так рада, что смогла вам помочь.

[@safar19899]

Your solution made the most sense to me. Thanks!

[@juli13585]

Really easy to understand explanation and the best I have seen for this problem, thank you so much!

[@sachinpawar2665]

Amazing content bro keep going, only time is your enemy, just wait for some time and you will reach to new heights.

[@nikoo28]

Hope so

[@Anuli-Edom]

Best explanation to this i have seen so far

[@nikoo28]

yay!!

[@VasundhraMinhas]

I came across this amazing video. Keep up the good work!

[@Uma_she]

You teaching way like hits deeply registered Thank you nikhil😊

[@IshaZaka]

what drawing tool you use to draw the diagrams? your way of explaning is so good

[@mohammedirfanu8180]

You are really teaching amazing sir, I can undestand very clearly❤

[@jjoelthomas]

Great tutorial. Just a small suggestion. int sum = 0 + carry; Is this needed? If 0 is going to be added every time in the loop we can just ignore it and write it like int sum = carry. I tried and it worked. Only if we need to add sum to sum then we need to write like int sum = sum + carry; otherwise I feel the 0 is redundant. Your thoughts on this please!!!

[@nikoo28]

0 + carry just seems familiar with what we are doing in the future. Makes your code more readable.

[@PremkumarIT]

very clear explanation brother ..I so great to find your videos

[@adityashinde7815]

Thank you brother your explanation is amazing . i understood this problem very clearly

[@rajeevkumarshetty4911]

super broo this is one of the best and easy solution i have ever seen thank you so much for this solution its really helpful🤩🤩😍😍👏👏

[@iosjumpstart]

dude I really appreciated the explanation, well done, thanks

[@KRajesh-ej7dy]

I Felt Happy After Listening This Thank You Bro

[@IshaZaka]

plz make hard level of leetcode as well, your explanation is so good

[@ilmanti]

Great explanation! Could you please explain how result contains the numbers if we're only assigning the numbers in the next for the ptr?

[@nikoo28]

the result does not contains numbers, it contains a linked list, that has the answer numbers. That is what the question asks as well :)

[@ilmanti]

@nikoo28 I understand, I used nunbers by mistake. What I meant is how does it contain the full linked list if we're only updating the ptr linked list? Hope that clears up the question!

[@nikoo28]

It still has single digits, you will have to interpret/construct the number from the list

[@RutwikKumbhar]

In the above case missing some test cases when both linked sizes are not the same that time above code will not work. Other your explanation is superb. add this code and sum variable will be global while(l2 != null){ sum = 0 + carry; sum += l2.val; l2 = l2.next; carry = sum / 10; sum = sum % 10; ptr.next = new ListNode(sum); ptr = ptr.next; } while(l1 != null){ sum = 0 + carry; sum += l1.val; l1 = l1.next; carry = sum / 10; sum = sum % 10; ptr.next = new ListNode(sum); ptr = ptr.next; }

[@nikoo28]

It will work, did you check the code available on Github?

[@deveshvyas3633]

Excellent Explanation 😀

[@cookiebrown3405]

this was a beautiful explanation. Thank you

[@TheA1facts]

Good work, Keep it up!

[@SinchannDekesuki]

i have a doubt in this question i was able to solve this problem without using any extra space after that i saw many sloution just to know different approach most of them are creating new linked list which is extra space i have stored my result in the linkedlist which has max length of question it is right to do so ? or i shouldn't modify the question's linked list..

[@joaoguilherme-or1ud]

Muito Obrigado por essa Explicação fantastica !!!

[@ToireasaMoley-mk3tw]

great explanation! so easy to follow :)

[@lil_paha]

Thank you ! You make best explanations :)

[@laxmanpatelpatel4657]

can you help do this type of question solution

[@nikoo28]

can you please elaborate?

[@alexpa24]

Very well explained. Thanks

[@natnaeldesta5932]

explained simply! thank you

[@nikoo28]

Glad it was helpful!

[@mennahassan5828]

thank u so much.your explanation is quite simple

[@nikoo28]

Happy to help

[@mennahassan5828]

@@nikoo28 but why not all medium questions in leetcode have videos.i suggest to increase number of medium questions

[@nikoo28]

@@mennahassan5828 It takes time to create quality content. I take almost a total of 10 hours to create one video with proper thumbnails, companies that it has been asked in, github links, thumbnails, editing etc. etc.. I also try to upload the content in full 4K quality for best viewing experience. Nonetheless, stay tuned...I am constantly trying to cover more and more important questions as time permits :)

[@mennahassan5828]

@@nikoo28 thank you so much.appreciated

[@SAIKISHORKARRI]

why we should add sum in the ptr.next?in think we should add in ptr.next.val ?

[@nikoo28]

can you tell me the timestamp you are referring to?

[@kidoo1567]

Always we search for nikil's leetcode solution ❤😅

[@nikoo28]

wow...I am grateful for that.

[@naveennaidu4855]

sir suppose in the last Iteration carry is more than one than what happens. in your code how can you decide carry is one... ?

[@nikoo28]

when you are adding 2 single digits, the carry can never be more than 1 :)

[@armaan8449]

I had the same question but, two single digits can't have carry more than 1

[@nandanupadhyaya4192]

Beautiful explanation..🔥🔥

[@boubacarboulkassoum2804]

Amazing bro keep going!! Love what you're doing. How can I contact you pls?

[@nikoo28]

You can contact me via e-mail. It is available in the "About" section of my channel :)

[@worthyvibes9989]

In problem values are 5 and 2 are giving for sum then ? carry = sum /10; -> 7/10 = 0.7; why sum is saving -> sum %10 ?? any one know ?

[@DataWorld1199]

This is a question for this problem. if l1 has more nodes than l2, then l2 next node is null. if number+null, we will get null? We should consider this situation. is it?

[@nikoo28]

check the problem constraints. You may need to modify your code accordingly :)

[@No-Nama-_-.0]

Thankyou sir 😊😊

[@thisisaniketup]

How will this eliminate the problem of test cases of very large numbers?

[@nikoo28]

because you are using linked lists. Each node will have only 1 digits. So your number can have 1000 digits, and still you will be able to add

[@evliyabilmemkimhazretleri9811]

thanks for the explanation.

[@anubhav.codess]

if(carry>0) { ptr.next=new Node(carry); } what if the value of carry is 2 or 3 or 4 ?

[@nikoo28]

When you add 2 digits, can the value of carry ever be more than 1 ??

[@81_monish_roy74]

thanks brother please continue helping us like this. we need a teacher cum mentor like u.💓

[@YeaminiNawal]

it was really helpful. thank you. just wanted to say that if the audio was clear it would have been more convenient, as ur voice feels like an echo. overall thanks

[@BCEKaushikKashyap]

thanku so much

[@naveenkumarkota2090]

understood thanks !

[@chakravarthybatna1589]

awesome explanation bro

[@satishagrawal5015]

nicely explained ,thank you

[@nikoo28]

Glad it was helpful!

[@reddibabu7415]

Thank u sir , subscribed

[@alejandrogonzalezalmazan3432]

Wouldn’t the first element in your solution node (zero) affect the final result? I didn’t get that

[@nikoo28]

In the provided code, the initial node with value 0 is actually a placeholder node. This is a common technique used in linked list problems to simplify the code and avoid special cases at the beginning of the list. It doesn't affect the final result of the summation. As the code processes the linked lists l1 and l2, the actual result is constructed starting from the node after the placeholder node. This is why, throughout the loop, new nodes are added after the placeholder node (since the code initializes ptr as result). The code returns result.next, which is the node immediately after the placeholder node. This is the correct starting point for the final result linked list.

[@suneosama939]

Hey bro i have a quesiton, why result next have the sum of ptr have add? I don't understand and question 2 is why you return head next instead of ptr next? Hmm maybe ptr next just a single node and result next all the node that ptr next have? Why result have all the sum that ptr next add, hmmm can you explain

[@nikoo28]

can you explain your question with an example? I am unable to follow your doubt.

[@suneosama939]

Its mean brother you're so good, understand that brother 😂😆

[@jmajid774]

Thanks. very cool video

[@Labib32]

Thanks you sir....

[@reyazahmed4855]

Yet another dsa channel. Same story different actor

[@satyamrajrawat5947]

Why are you here then 🤡 ? Go do DSA on your own

[@winningPages]

Worth the time

[@nikoo28]

appreciate your feedback

[@pankajyadav-en7tb]

Wow!!.

[@suneosama939]

Thank you

[@honey-xr5kp]

I must be doing something wrong, but all my test cases come back as wrong with this code.

[@honey-xr5kp]

It adds an extra 0 to the beginning of the list each time. I'm not sure how or why?

[@nikoo28]

Did you have a look at the code given in video description?

[@bibekanandapattanaik4293]

Thanks

[@krsvlog1742]

code didn't worked on leetcode man what to do ?

[@nikoo28]

that is not possible. try the code available on github (link in description)

[@Novakid04]

I dont understand why when we return result.next we get something iw we didnt add anything in it.

[@nikoo28]

result.next has the complete linked list

[@Novakid04]

@@nikoo28 Thank you, I figured it out after some time.

[@usmanrangrez-cd7zj]

class Solution { public: ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { ListNode *ans = new ListNode(0); ListNode *curr=ans; ListNode *p=l1; ListNode *q=l2; int carry = 0; while(p!=NULL || q!=NULL){ int firstData = (p!=NULL)?p->val:0; int secondData = (q!=NULL)?q->val:0; int sum=firstData+secondData+carry; carry=sum/10; int toPut = sum%10; curr->next = new ListNode(toPut); curr=curr->next; if(p!=NULL) p = p->next; if(q!=NULL) q = q->next; } //end pe agar carry milega 1 if(carry>0){ curr->next = new ListNode(carry); } return ans->next; } }; Different Approach

[@hermionegrangerleviosa870]

Bro can you explain same problem by using python

[@nikoo28]

the logic will remain the same, it gets a little hard to solve for every language

[@satyamrajrawat5947]

Great

[@arijitmalakar6911]

This solution is giving "time limit exceeded" error n leetcode...

[@priyarani306]

Which language has he used?

[@nikoo28]

JAVA

[@sumitmalpure944]

I think result always dummy.next and when comes to travel to end use two pointers

[@nikoo28]

that will always work wonderfully for you

[@chuckynorris616]

praise lord ganesh

[@nikoo28]

🙏

[@shubhamkishordevghare5826]

🎉

[@hemanthreddy2]

Bro please take backtracking problems, they making me to leave whole DSA

[@code-Dude]

can someone help me /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ListNode(int val) { this.val = val; } * ListNode(int val, ListNode next) { this.val = val; this.next = next; } * } */ class Solution { public ListNode addTwoNumbers(ListNode l1, ListNode l2) { l1 = revesrseLL(l1); l2 = revesrseLL(l2); ListNode head = new ListNode(0); ListNode temp = head; int carry = 0; while( l1 != null || l2 != null ){ int sum = carry; if(l1 != null){ sum = sum + l1.val; l1 = l1.next; } if(l2 != null){ sum = sum + l2.val; l2 = l2.next; } //check carry and sum carry = sum / 10; sum = sum % 10; temp.next = new ListNode(sum); temp = temp.next; sum = 0; } if(carry==1){ temp.next = new ListNode(1); } return head.next; } public ListNode revesrseLL(ListNode head) { ListNode pre = null; ListNode cur = head; ListNode nxt; while (cur != null) { nxt = cur.next; cur.next = pre; pre = cur; cur = nxt; } return pre; } }

[@JP-programming]

thanks for the great explanation.