2181. Merge Nodes in Between Zeros | Linked List | How to Write Linked List Code

In this video, I'll talk about how to solve Leetcode 2181. Merge Nodes in Between Zeros | Linked List | How to Write Linked List Code
Let's Connect:
📱Discord (Join Community) : / discord
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / codewitharyanbhai
💻 Twitter - / aryan_mittal007
🤖 Github: github.com/aryan-0077
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[@Yashcolab]

0:40 i was not prepared for that

[@ARYANMITTAL]

Facts bro facts🌚🥲

[@coderunner743]

thanks, bro because of you I got placed in Zoho.

[@ARYANMITTAL]

Congratulations man ❤️🫡, big big Congratulations 🥳🔥

[@coderunner743]

@@ARYANMITTAL thanks bro

[@sanebrain3083]

i want to practice this list type of questions more like where i get to practice while complicated writing of code is there what to do can you give list of such question

[@ARYANMITTAL]

This will help, it has 20 very nice problems - kzbin.info/aero/PLEL7R4Pm6EmABenswDvaCGhiLNlExFKM8

[@worldofgaming748]

0:40 "Bro is getting personal day by day"

[@naamnhibataunga5897]

this is my code: i think it is better because i didn't have to think of any edge cases. class Solution { public: ListNode* mergeNodes(ListNode* head) { ListNode *dummy=head; ListNode *curr=dummy; int sum=0; ListNode *temp=head; temp=temp->next; while(temp){ if(temp->val!=0){ sum+=temp->val; temp=temp->next; }else{ if(sum!=0){ curr->next=new ListNode(sum); curr=curr->next; } sum=0; temp=temp->next; } } ListNode *ans=dummy->next; delete dummy; return ans; } };

[@bhamidipatisatwik1165]

what about the case where there are two consecutive 0 nodes? is this case being handeled as there shouldn't be 0s in the resulatant list.

[@KarthikMadan-x5c]

@karthikmadanaryan bhai goldman me apply krna rehgya please kuch help kr skte ho?

[@karthikmadan]

aryan bhai goldman me apply krna rehgya please kuch help kr skte ho?

[@NoName-hd7ok]

Bro maine cf pe just expert touch kiya , dev me mern kiya h bs tutorial dekh kar , project bhi yt se chhapkar blog app bnaya h , intern ke liye next 1 month me kya krna chahiye , if from an avg NIT?

[@arnavkaul7827]

make a project now but on your own think like a dev -read docs(verry underrated tip imo), utilise resources like stack overflow etc implement if it doesnt work repeat the process.. And bhai expert pahuchne pe kitna time laga and usme mujhe thode tips dede

[@NoName-hd7ok]

@@arnavkaul7827 ok bhai , nov se seriously kr rha tha cp

[@user-zz9pr5mu8o]

whose company ask these question

[@dayashankarlakhotia4943]

ListNode mergeNodes (ListNode head){ ListNode p1=head.next,p2=p1; while(p2!=null){ int sum=0; while(p2!=null&&p2.val!=0){ sum+=p2.val; p2=p2.next; } p1.val=sum; p2=p2.next; p1.next=p2; p1=p1.next; } return head.next; } 🎉❤

[@ARYANMITTAL]

Awesome Daya Shankar 🫡❤️

[@sagaragrawal6315]

class Solution { public: ListNode* mergeNodes(ListNode* head) { ListNode* dummy=new ListNode(); ListNode* temp=dummy; while(head->next!=nullptr){ dummy->next=head; head=head->next; dummy=dummy->next; while(head!=nullptr&&head->val!=0){ dummy->val+=head->val; head=head->next; } } dummy->next=nullptr; return temp->next; } }; this is also o(1) space na

[@karthikmadan]

aryan bhai kuch help krdo Goldman ki date nikl gyi pls bhai

[@ARYANMITTAL]

Link bhejo bro job opening ka linkedin pr, recruiter ka email bhejte hai, its a long story why I would be recommending to apply via cold email to recruiter !!

[@karthikmadan]

aryan bhai goldman me apply krna rehgya please kuch help kr skte ho?

[@karthikmadan]

aryan bhai goldman me apply krna rehgya please kuch help kr skte ho????