2181. Merge Nodes in Between Zeros Leetcode daily challenge | DSA | Hindi
HTML-код
- Опубликовано: 4 окт 2024
- Problem:
2181. Merge Nodes in Between Zeros
Problem Statement:
You are given the head of a linked list, which contains a series of integers separated by 0's. The beginning and end of the linked list will have Node.val == 0.
For every two consecutive 0's, merge all the nodes lying in between them into a single node whose value is the sum of all the merged nodes. The modified list should not contain any 0's.
Return the head of the modified linked list.
Problem Link:
leetcode.com/p...
Graph Playlist:
• Graph Data Structure S...
Java Plus DSA Placement Course Playlist:
• Java and DSA Course Pl...
Java Plus DSA Sheet:
docs.google.co...
Notes:
github.com/Tiw...
Telegram Link:
shashwattiwari...
Ultimate Recursion Series Playlist:
• Recursion and Backtrac...
Instagram Handle: (@shashwat_tiwari_st)
shashwattiwari...
Samsung Interview Experience:
• I cracked Samsung | SR...
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
#ShashwatTiwari #coding #problemsolving
wow there is no channel on youtube that explains DSA in such a short, effective & direct way! Thanks for knowledge.
Thanks 😊, today I approached this problem like you did .
Thank you, sir. Sout("#shashwat tiwari"); Easily understandable question appeared: How to do it! I have 💯 % support for you. Please continue solving the LeetCode problems using the Java language to maintain our consistency and hard work in doing daily questions.
Bro literally explained so gently and effectively ❤️🤙
Thanks brthr
Love from Canada ❤
Your way of explaining is great. Looking forward to more daily challenges.
Please add all Java videos from beginners to advanced till date in one single playlist 🙏🙏
It is a bit confusing from where to start so I can learn all concepts from beginners level to oops to DSA concepts.
So please a single playlist 🙏🙏
Bhai sir ki channel me 170 video ka playlist hai check out kar le bhai
as usual ....shash code on it's work again...but this time..i solved it by my own! cheers!
osm sir
whose company ask this question??
node =temp? kyu node kyu lele rahe h
sir i am currently on sorting topic and know array and string and bas recursion so should i need to do this question just for a badge???means i will understand problem and your approach then do code its okay to do aur i should only do a topic of potm which relevent to my current knowledge??
jo jo data structure padh liye ho uske questions kr skte ho. Baaki jaise jaise krte jao waise padh lena
@@shashwat_tiwari_st so basically jo topic nhi kiye uske daily question nhi karu??
@@PrakashRai-ff3pr ha smjh nhi aaega..
@@shashwat_tiwari_st okay thankyou❤️...mai issi mai confuse tha kyuki last month mene saare questions kiye daily chalanege k and jo bhi new data structures k topic aaye jo aate nhi aapke video dekhe but at the end esa lgta ki yeh shi bhi hai like kuch chize samj aa rhi and kuch bilkul nhi to ese jo topic nhi padhe karna chahiye ya nhi ab doubt clear ho gya👍❤️