The first person to enable me to see this problem clearly. You have a gift for speech.
@chiranjeevipippalla4 жыл бұрын
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. 👏👏👏
@NideeshTerapalli4 жыл бұрын
Thanks Chiranjeevi. Btw, I am a megastar fan
@binetlee25343 жыл бұрын
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!
@tpsspace73975 ай бұрын
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
@fantasy99602 жыл бұрын
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!
@ChadS444 жыл бұрын
Specifically calling attention to the recursive "branches" separates this video from similar attempts to explain backtracking. Thank you!
@ragavnitinpande56124 жыл бұрын
This is the best explanation I came across. Most of the people just eat and spit out the solution.
@NideeshTerapalli4 жыл бұрын
thanks!
@jelliott14584 жыл бұрын
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.
@vasachisenjubean59444 жыл бұрын
Alright the explanation is damn good and you promptly remade this video. Thanks a lot!💯💯
@Mexximillion3 жыл бұрын
I am hardly managing to not spam compliments in capslock here. This explanation was absolutely amazing.
@NideeshTerapalli3 жыл бұрын
Wow thanks Max!
@sofoboachie52214 жыл бұрын
Best explanation of this problem on youtube. Went through all my usual guys, but they all flopped this question. Earned a sub
@sivakumarg984 жыл бұрын
Ohhh man.. Where you have been this long... 😊🤟 Great explanation 📌
@AK090373 жыл бұрын
watched 8+ vids and this is the one that actually made sense thank you
@josephyang21833 жыл бұрын
Thanks for the quality explanation of the problem. Much appreciated
@NideeshTerapalli3 жыл бұрын
my pleasure
@tarankaranth87823 жыл бұрын
super clear. thank…i checked out many video non as clear as yours
@NideeshTerapalli3 жыл бұрын
Appreciate it
@michael36203 жыл бұрын
beautiful explanation! i was struggling with backtracking and this cleared everything up.
@niharikapatil9023 жыл бұрын
Love the video!
@rickzheng89484 жыл бұрын
best explanation on KZbin so far
@DyiLuaN4 жыл бұрын
Useful video, thanks dude!
@NideeshTerapalli4 жыл бұрын
Welcome man
@JannibalForKing2 жыл бұрын
I love you Nideesh
@rishmithahahaha2 жыл бұрын
where do we check for duplicates in this approach ?
@abhinay42003 жыл бұрын
very good explanation .
@TheProximator3 жыл бұрын
Exceptional, thanks a lot
@kdvr604 жыл бұрын
Awesome, man! Thumbs up!
@sahilmehra2902 жыл бұрын
what does List means exactly
@shiladityadey83763 жыл бұрын
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); }
@baihongli45124 жыл бұрын
great! thanks
@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)