2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281

Рет қаралды 4,624

2 жыл бұрын

Here in this video we have discussed the approach to solve
2181. Merge Nodes in Between Zeros of Weekly Contest 281.
Question Link :- leetcode.com/contest/weekly-c...
Presenting you the best placement preparation course document down here
👇(You can download the sheet and use it as a tracker as per your convenience).
⭐ Link for the Bro Coders PPC sheet:- onedrive.live.com/view.aspx?r...
After this if you need doubt support join our telegram channel for getting it solved
👇🏻
🔔Join the telegram channel for doubts and discussions:-t.me/joinchat/wSYWX-gbgoRjNmNl
If you follow this course in sequential manner it would be most optimal. Otherwise if you are at intermediate level and want selective preparation of any particular topic you can jump directly, otherwise it's not suggested. And also since it's our new endeavor to help out students with quality education free of cost . So please help us in this mission!!!
❇️ Like, Share, Subscribe!!
========================================================================
🔔Follow us on Instagram:- / bro_codrs
🔔Join the telegram channel for doubts and discussions:-t.me/joinchat/wSYWX-gbgoRjNmNl
========================================================================
Link to our other major series:-
✅Dynamic Programming: kzfaq.info?list...
✅Recursion: kzfaq.info?list...
✅Backtracking: kzfaq.info?list...
✅Greedy: kzfaq.info?list...
✅Array: kzfaq.info?list...
✅Hashing: kzfaq.info?list...
✅Linked List: kzfaq.info?list...
✅Binary Search Tree : • Search in a Binary Sea...
✅Binary Tree : • Binary Tree -Course In...
✅Stack : • Parenthesis Checker |...
✅Queue : • Queue Basics and STL||...
✅Maths: • Find factors , check f...
========================================================================
🔱To buy books at excessive cheap prices and sell your old books, visit :- www.bookstop.me
========================================================================
For convenience, refer to given timestamps:-
========================================================================
#BroCoders #LeetCode #InteviewBits #GFG #PlacementCourse #dp #stack #queue #maths #greedy #array #binaryTree #BST #Graphs #recursion #backtracking #string #stl #c++ #java #DSA #CompetitveProgramming #CodeForces #CodeChef #ICPC #CompetitiveCoding #FreePlacementSeries #Microsoft #Google #Amazon #Apple #Facebook #FlipKart #Netflix #TowerResearch #VMWare #DirectI #CodeNation #Infosys #GoldmanSachs #TCS #Tier3 #IIT #NIT #IIIT #Interview #Aptitude #Contest #CodingContest #HackerRank #HackerEarth #BinarySearch #BroCode #Trending #PlacementUpdates #PlacementNotification #IntenshipUpdates #InternshipNotification #LinkedIn #Samsung #Naukri #SoftwareEngineer #Hackathon #SoftwareDevelopmentEngineer #SDE #IT #ComputerScience #CSE #FAANG #DynamicProgramming #2129#LeetCode #CapitalisetheTitle #WeeklyLeetCode279
#solution #answer #Fastest_answer
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281
2181. Merge Nodes in Between Zeros || LeetCode 2181 || LeetCode Weekly Contest 281

Пікірлер: 13

@pritishpattnaik4674 2 жыл бұрын

I also did the same approach , keep making videos bhai

@BroCoders 2 жыл бұрын

Thanks bhai!! Surely :))

@VY-zt3ph 2 жыл бұрын

Waiting for third. I figured out the approach but couldn’t programmed it.

@BroCoders 2 жыл бұрын

The video is out!!

@chiragvohra6673 Жыл бұрын

what will be the complexity for this solution?

@BroCoders Жыл бұрын

O(N)

@manishdaga 2 жыл бұрын

Ram Ram

@BroCoders 2 жыл бұрын

Jai Shree Ram!!

@ishikasingh3313 Жыл бұрын

Time limit exceeded

@BroCoders Жыл бұрын

It is accepted code

@angshumanvlogs2613 Жыл бұрын

Code is not working class Solution { public: ListNode* mergeNodes(ListNode* head) { ListNode* result= new ListNode(0);//here is the new linked list for the implementation ListNode* test=result; ListNode* temp=head; temp=temp->next; int sum=0; while(temp!=NULL) { while(temp->val!=0) { sum+=temp->val; temp=temp->next; } test->next= new ListNode(sum); test=test->next; temp=temp->next; sum=0; } return test->next; } };

@analyticswithjaspreet Жыл бұрын

initialize temp with temp -> head.next , as the first value will always be zero , as per question

@sandeepkumarg1889 10 ай бұрын

return result->next karo;