Flatten Nested List Iterator | 3 Approaches | Full Details | GOOGLE | NETFLIX | Leetcode - 341

This is the 12th Video on our Design Data Structure Playlist.
In this video we will try to solve a very good Design Problem - Flatten Nested List Iterator (Leetcode-341).
Share your learnings on LinkedIn, Twitter (X), Instagram, Facebook(Meta) with #codestorywithmik & feel free to tag me.
I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY. We will do live coding after explanation and see if we are able to pass all the test cases.
Problem Name : Flatten Nested List Iterator
Company Tags : META | GOOGLE | NETFLIX | TWITTER
My solutions on Github : github.com/MAZ...
Leetcode Link : leetcode.com/p...
My DP Concepts Playlist : • Roadmap for DP | How t...
My Graph Concepts Playlist : • Graph Concepts & Qns -...
My GitHub Repo for interview preparation : github.com/MAZ...
Subscribe to my channel : / @codestorywithmik
Instagram : / codestorywithmik
Facebook : / 100090524295846
Twitter : / cswithmik
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge#leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook

[@FanIQQuiz]

This is the lengthiest and most informed explanation of this problem on KZbin. I checked other videos as well but this one is a gem

[@iWontFakeIt]

what an explanation man!!! loved it, too good man, same as always watching you for the past 6months

[@codestorywithMIK]

Means a lot 🙏😇

[@wearevacationuncoverers]

You are the only guy, whose long videos I watch with full interest.

[@pritamkumarpattanayak1497]

this is the question i was asked for a company havign 4.5 lpa. So everyone watching this comment increase your level. this it platforms copetition is too much hard now a days.

[@HealthyOm]

love u bhaiay keep doing world greatest work for DSA fearful students .... .. and make much more concept related vedios .... we love ur qns apporaching type everyone want learn it ... plase love love love love love love u bhaiaya😘😘

[@codestorywithMIK]

Means a lot. Thank you 🙏😇❤️

[@wearevacationuncoverers]

Coded on my own after the explanation ended 15:14 Thanks for the detailed explanation.

[@satyamkushwaha6217]

Unbelievable explanation sir.❤❤

[@akashkumarmaurya2319]

No doubt solution is super easily explained . and i am learning alot not only concept but also how to explain like u ..all is set but there is some lag between yr voise and text of i think 1 second . if u do so it will be great .. it is only a feedback , but for me its all okay..

[@codestorywithMIK]

Thank you so much. Let me try to fix the lag. Thanks a lot for your feedback 🙏😇

[@Piyushraj0]

Nicely explained once again❤ I was asked a similar question 5months back for an intern role in javascript. I couldn't solve it that time. I solved this leetcode one in one go as a revenge 😅😂😭.

[@codestorywithMIK]

Wow. That’s what i call a comeback 🔥🔥🔥 Let’s keep working hard anf growing like this 💪💪💪

[@UECAshutoshKumar]

Thank you!

[@nagmakhan3165]

Thanks for covering minute details. Gonna learn a lot from you

[@thefinalfit]

Most detailed and best explanation. Thanks a lot

[@nealsutaria2633]

Amazing!

[@souravjoshi2293]

dope explanation of all the approaches.

[@de_coder1]

Your explanations are damn good❤❤

[@codestorywithMIK]

Means a lot 😇🙏

[@JoyAcharyatvl]

awesome boss. Thanks

[@codestorywithMIK]

You're welcome! 😇🙏

[@trailsnail]

good, better, best. Can the approach 3 be said to be having a amortized constant time as the flattening is being done in the constructor itself

[@codestorywithMIK]

Definitely 👌👌👌

[@tutuimam3381]

Thanks a lot

[@newglobal7271]

Bhaiya ajj bhi maja agya🙏🙏❤❤❤❤❤❤

[@codestorywithMIK]

Means a lot. Thank you so much 🙏😇

[@ss8273]

maza aagya bhaiya 👌👌👌👌

[@codestorywithMIK]

🙏😇

[@kunal4710]

This would give best time and space complexity Approach 3 - //Store address instead of object to reduce space queue q; void openList(vector &nestedList){ int n= nestedList.size(); for(int i=0;igetInteger(); q.pop(); return el; } bool hasNext() { return !q.empty(); }

[@DevOpskagyaan]

You are just awesome ❤

[@23cash86]

Thanks alot

[@codestorywithMIK]

Most welcome 😇

[@musaddikkhan9720]

Bro I just feel fear for this type of question and oops and ptr se kya dushmani hai pata hi nahi kitne bhi videos dekh lo bheje me ghus jate hai aur phir wapas nikal jaate hai.... aur abhi jo tmne kaha woh bhi ab pata chala pr khud karunga na to bilkul nahi samjega ki woh const pr & kyun lia waise thanks for video

[@codestorywithMIK]

I can understand. Actually there are lots of minute details in OOPs which I also always forget. I will try to make a playlist for OOPs too. For now, let me give a small brief which will help why I used & : If you simply write , vector vec = curr->getList(); This attempts to assign the result of curr->getList() to a vector named vec. The issue here is that getList() returns a const vector &, which means it returns a constant reference to a vector of NestedInteger objects. You cannot directly assign a constant reference to a non-constant object like vector vec. If you want to store the result of getList() in a new vector, you should make sure the new vector is also a constant reference or a constant object. So, we wrote &. You can also write as follows : const vector& vec = curr->getList(); Or, vector& vec = curr->getList();

[@musaddikkhan9720]

Thank You So much mazhar bhai really helpful... maine ye notebook me likh lia aur const keyword bhi padh lia... const keyword like a promise in real world we cannot change it..etc etc uske niche ye bhi likh lia 😊🫂

[@xiaoshen194]

Bhai maine exact ye ques JS seekhte waqt kia tha. Do check it out :

[@xiaoshen194]

30 days of JavaScript (study plan) -> flatten a deeply nested array.

[@xiaoshen194]

kzbin.info/www/bejne/lXXIpX-GgNl5hM0si=XqxgUOXhOAt-AJaV Aur ye uska solution.

[@codestorywithMIK]

Hey wow. That’s awesome. Thank you for sharing 🙌❤️

[@harikrushnasuhagiya3925]

Thank you so much brother

[@codestorywithMIK]

Always welcome 🙏😇

[@TheProblemSolvers38]

Is there a lag between the audio and video or Is the problem on my end ?

[@codestorywithMIK]

It seems to be in sync at my end. Can you confirm if you are facing this for this video or any other video also ??

[@harshtiwari416]

Bhai const pr & kyu liya tha please oops ka concept clear hai fir bhi samajh nhi aarha thodi direction dedoo btw Nice work keepitup

[@codestorywithMIK]

If you simply write , vector vec = curr->getList(); This attempts to assign the result of curr->getList() to a vector named vec. The issue here is that getList() returns a const vector &, which means it returns a constant reference to a vector of NestedInteger objects. You cannot directly assign a constant reference to a non-constant object like vector vec. If you want to store the result of getList() in a new vector, you should make sure the new vector is also a constant reference or a constant object. So, we wrote &. You can also write as follows : const vector& vec = curr->getList(); Or, vector& vec = curr->getList();

[@harshtiwari416]

@@codestorywithMIK ty bhaiya

[@RajSingh-te1uo]

At 41:25 why & is used with NestedIntger to create obj ...I'm not good at OOP.. anyone please?

[@codestorywithMIK]

If you simply write , vector vec = curr->getList(); This attempts to assign the result of curr->getList() to a vector named vec. The issue here is that getList() returns a const vector &, which means it returns a constant reference to a vector of NestedInteger objects. You cannot directly assign a constant reference to a non-constant object like vector vec. If you want to store the result of getList() in a new vector, you should make sure the new vector is also a constant reference or a constant object. So, we wrote &. You can also write as follows : const vector& vec = curr->getList(); Or, vector& vec = curr->getList();

[@RajSingh-te1uo]

@@codestorywithMIK Thank you sir for writing this long explanation ♥️... Really thank you!

[@parthbhatti4151]

i know basic of all dsa so how can i use your channel to reach at good level on DSA because your channel have lot's of playlist so how should i start with your channel to i will have maximum utilize ?

[@kamranwarsi12b22]

How to approach these design based questions, usually i get confused like what should be the way of thinking ?

[@codestorywithMIK]

I have tried to explain in the starting of the video like how to approach in flattening qns. Generally design based Qns want you to crack that which DS you will use that will solve the problem most efficiently. Usually I try with the simplest Data Structure and solve. Once done, i see which functions are slow and how we can improve it.

[@kamranwarsi12b22]

@@codestorywithMIK oh ok ok...

[@user-kaushikeemishra]

bhaiyaa please java me bhi code likhkr samjha kr diyaa krooo.... mai java me code krti hu aur begginer hu..to muje sbka meaning nhi samj aata hai... plese bhaiayyyaa

[@codestorywithMIK]

Actually I provide similar java code in my Github link. Will that help ? Actually explaining the Java code might extend the video length sometimes

[@user-kaushikeemishra]

@@codestorywithMIK bhai aap bs hard problems me Java me code ko thoda sa explain kr dijiyega...kyuki usme kafi high level ki chize aa jati ho samj nhi aati hai...agr esa possible ho to kr dijiyega baki aap bahut achha explain krte hai..Mai hard problems ko bhi samjne ki kosis kraugi.......

[@YashJain-ex2ex]

Hii, pelase solve Odd Even and Racecar leetcode problem not able to found any proper source to understand it Leetcode - 818 Leetcode - 975

[@codestorywithMIK]

Sure noted.

[@devkumar9889]

Kaha se easy q hai ye 🥲, itne hints ke baad bhi nai hua tha mere se

[@codestorywithMIK]

Actually the naive approach - storing all integers in an array or a queue comes in a handy solution. However using stack will need some practice to get hands with. I am sure with more practice we will be able to solve such qns with ease. Let’s keep moving 🙏😇💪💪