Populating Next Right Pointers in Each Node | Leet code 116 | Theory explained + Python code

This video is a solution to Leet code 116, Populating Next Right Pointers in Each Node. I explain the question, go over how the logic / theory behind solving the question and finally solve it using Python code.

Comment below if you have a better solution to this problem!

Let me know if you have any feedback and don't forget to subscribe for more videos!

Code:

Time stamps:
0:00 Question
2:27 Solution explained
10:09 Python code

More leetcode questions solved:

Gear used:

[RomanKnav]

Coming in with the clutch! Great explanations and visuals 👍

[leocorelli]

Great video, great explanation. Thank you!

[서울_반_김노아]

your explanation is so clean! thank you!!

[sukanyabag]

Hi! Thanks a lot for providing such beautiful explanations for the problems along with the python code! Since I am also a python practitioner, it is really helpful for me as most of the time people provide solutions in c++. It will be a great help if you also provide a solution for the problem "Can Place Flowers" of Leetcode too!

[VarshaBudihal]

hey can you show a variation of the problem as mentioned in #117? populating next right pointer in each node ii ? Thanks

[sudip]

Thanks for the exaplanation! Quick question - Whats the reason to deque the input?

[saibharadwajvedula]

thumbnails do not let us watch the last part of the video. Prolong the video a bit after the code part. Say Thank you, good bye! whatever suits you