(Remade) Subsets I | Leetcode 78 | Backtracking

  Рет қаралды 10,324

Nideesh Terapalli

Nideesh Terapalli

Күн бұрын

Пікірлер: 38
@MakingVidsBreh
@MakingVidsBreh 2 жыл бұрын
The first person to enable me to see this problem clearly. You have a gift for speech.
@chiranjeevipippalla
@chiranjeevipippalla 4 жыл бұрын
There are videos on this topic with 26 minutes duration explaining just the tree diagram without any code. Everyone can explain the tree diagram but connecting the diagram with the code is the reason why we come to watch a video. This guy connected the two in under 10 minutes. 👏👏👏
@NideeshTerapalli
@NideeshTerapalli 4 жыл бұрын
Thanks Chiranjeevi. Btw, I am a megastar fan
@binetlee2534
@binetlee2534 3 жыл бұрын
This is the best way I've seen the Subset problem logic drawn out, conceptualized, and converted into code. You nailed it with this explanation - super helpful!
@tpsspace7397
@tpsspace7397 5 ай бұрын
wow this video helped me so much, seeing it draw on a whiteboard and more in person is so much more helpful then looking at the code myself
@fantasy9960
@fantasy9960 2 жыл бұрын
Please please please make more videos! I have watched many Q78 videos, but yours is definitely the best and structured overall! Thank you so much sir!
@ChadS44
@ChadS44 4 жыл бұрын
Specifically calling attention to the recursive "branches" separates this video from similar attempts to explain backtracking. Thank you!
@ragavnitinpande5612
@ragavnitinpande5612 4 жыл бұрын
This is the best explanation I came across. Most of the people just eat and spit out the solution.
@NideeshTerapalli
@NideeshTerapalli 4 жыл бұрын
thanks!
@jelliott1458
@jelliott1458 4 жыл бұрын
By far the best explanation I've seen. The recursive tree helped immensely with understanding the reason for the remove after returning from the stack call.
@vasachisenjubean5944
@vasachisenjubean5944 4 жыл бұрын
Alright the explanation is damn good and you promptly remade this video. Thanks a lot!💯💯
@Mexximillion
@Mexximillion 3 жыл бұрын
I am hardly managing to not spam compliments in capslock here. This explanation was absolutely amazing.
@NideeshTerapalli
@NideeshTerapalli 3 жыл бұрын
Wow thanks Max!
@sofoboachie5221
@sofoboachie5221 4 жыл бұрын
Best explanation of this problem on youtube. Went through all my usual guys, but they all flopped this question. Earned a sub
@sivakumarg98
@sivakumarg98 4 жыл бұрын
Ohhh man.. Where you have been this long... 😊🤟 Great explanation 📌
@AK09037
@AK09037 3 жыл бұрын
watched 8+ vids and this is the one that actually made sense thank you
@josephyang2183
@josephyang2183 3 жыл бұрын
Thanks for the quality explanation of the problem. Much appreciated
@NideeshTerapalli
@NideeshTerapalli 3 жыл бұрын
my pleasure
@tarankaranth8782
@tarankaranth8782 3 жыл бұрын
super clear. thank…i checked out many video non as clear as yours
@NideeshTerapalli
@NideeshTerapalli 3 жыл бұрын
Appreciate it
@michael3620
@michael3620 3 жыл бұрын
beautiful explanation! i was struggling with backtracking and this cleared everything up.
@niharikapatil902
@niharikapatil902 3 жыл бұрын
Love the video!
@rickzheng8948
@rickzheng8948 4 жыл бұрын
best explanation on KZbin so far
@DyiLuaN
@DyiLuaN 4 жыл бұрын
Useful video, thanks dude!
@NideeshTerapalli
@NideeshTerapalli 4 жыл бұрын
Welcome man
@JannibalForKing
@JannibalForKing 2 жыл бұрын
I love you Nideesh
@rishmithahahaha
@rishmithahahaha 2 жыл бұрын
where do we check for duplicates in this approach ?
@abhinay4200
@abhinay4200 3 жыл бұрын
very good explanation .
@TheProximator
@TheProximator 3 жыл бұрын
Exceptional, thanks a lot
@kdvr60
@kdvr60 4 жыл бұрын
Awesome, man! Thumbs up!
@sahilmehra290
@sahilmehra290 2 жыл бұрын
what does List means exactly
@shiladityadey8376
@shiladityadey8376 3 жыл бұрын
I thought collecting from the leaves makes it more intuitive. You seem to be collecting every time control comes to line#3 in your code. public static void combination1(int[] input, int i, List result, List path) { if (i == input.length) { result.add(new LinkedList(path)); return; } path.add(input[i]); combination1(input, i + 1, result, path); path.remove(path.size() - 1); combination1(input, i + 1, result, path); }
@baihongli4512
@baihongli4512 4 жыл бұрын
great! thanks
@NideeshTerapalli
@NideeshTerapalli Жыл бұрын
Hey there! Just wanted to let you know that some of the links in this comment are affiliate links, which means that if you make a purchase through them, I may earn a small commission. Don't worry though, it doesn't cost you anything extra and it helps support this channel so I can continue to make more videos for you. Thank you so much for your support, and as always, all opinions are my own! Start getting great at system design: bytebytego.com?fpr=nideesh (affiliate link) Handpicked Algorithms and Data Structures for Interview To Save Time: interviewpen.com/?via=nideesh (affiliate link) Fast track to becoming a knowledgeable SWE www.educative.io/unlimited?aff=K1z6 (affiliate link)
@nitishsingh3470
@nitishsingh3470 3 жыл бұрын
He is looking exactly like rajkumar Rao😂😂
@nilaysheth3283
@nilaysheth3283 4 жыл бұрын
You look like Rajkumar Rao from Bollywood
Subsets - Backtracking - Leetcode 78
8:47
NeetCode
Рет қаралды 304 М.
I Solved 100 LeetCode Problems
13:11
Green Code
Рет қаралды 293 М.
小丑教训坏蛋 #小丑 #天使 #shorts
00:49
好人小丑
Рет қаралды 54 МЛН
Каха и дочка
00:28
К-Media
Рет қаралды 3,4 МЛН
How I Mastered Data Structures and Algorithms in 8 Weeks
15:46
Aman Manazir
Рет қаралды 143 М.
[Java] Leetcode 78/90. Subsets I/II [Backtracking #6]
14:06
Eric Programming
Рет қаралды 3,6 М.
How I would learn Leetcode if I could start over
18:03
NeetCodeIO
Рет қаралды 753 М.
Premature Optimization
12:39
CodeAesthetic
Рет қаралды 845 М.
L11. Subset Sum II | Leetcode | Recursion
30:16
take U forward
Рет қаралды 347 М.
I Solved 1583 Leetcode Questions  Here's What I Learned
20:37
ThePrimeTime
Рет қаралды 776 М.
Subsets - Leetcode 78 - Recursive Backtracking (Python)
11:51
Greg Hogg
Рет қаралды 12 М.
小丑教训坏蛋 #小丑 #天使 #shorts
00:49
好人小丑
Рет қаралды 54 МЛН