best explanation, other explanations in youtube should be deleted
@ganeshjaggineni4097Ай бұрын
NICE SUPER EXCELLENT MOTIVATED
@randomeverything8304Ай бұрын
Very bad explanation. You should quit coding.
@TheKirk1989Ай бұрын
dunno, why 12354 is permutated to 12435 ??? In the description of this task says "ADJACENT" only.. why 12354 > 12435 , how can we swap 3 and 4 in this case? It's not adjacent . 13254 maybee?
@AparajitaShinde2 ай бұрын
Very informative video. I have a question - On teamcity server, I have done soapui setup and reports are generated using ANT and groovy script as well. Can we integrate the generated reports results on teamcity and show the report results on teamcity? please share the details.
@bitsforbits65812 ай бұрын
i dont understand why sorting?,,,,because ha harmonic subsequence is that in which order remains unchanged
@christinemello6942 ай бұрын
You explained it brilliantly! This is the best explanation I found for this problem
@peaceikechukwu39762 ай бұрын
I had to go back to some basic mathematics on Sequences and series to understand the recurrence relations. This is great vid. Thanks for the work and time you put into this !!♥
@aditigupta68703 ай бұрын
whats your approach basically? Its confusing little, are you going via the approach of having all permutations of single digits, then 2 digits, then if N itself is 3 digits then all perumtations from 100 till N?
@artikoppar3 ай бұрын
How to run this build xml if you want to run more than 2/3 projects for getting 1 html report
@ashishkothari28453 ай бұрын
stack.pop().getInteger() how it works ???
@mohammadyahya783 ай бұрын
wow what amazing expalantion for uick sort
@mohammadyahya783 ай бұрын
amazing solution
@victormadu16354 ай бұрын
Thank you!
@sabu45394 ай бұрын
thank you
@isbhakhalid17844 ай бұрын
Amazing Explanation👏👏
@abheermehrotra3294 ай бұрын
Best explanation , so simple.
@samridhshubham81095 ай бұрын
Excellent, clean cut explanation
@easyvedicmaths8865 ай бұрын
but why this is BFS and not dp?
@user-xr9fx9dj6m5 ай бұрын
Thanks, very good explanation.
@easyvedicmaths8865 ай бұрын
why we dont use a for loop by calcuting the size of queue and exploring all childs once?
@mikedelta6586 ай бұрын
I wasn't merely looking for the answer rather I was digging for a clear demonstration. Here it is. Thank you.
@omkaranabathula19796 ай бұрын
Great explanation, subscribed++
@CodersCamp5 ай бұрын
Awesome, thank you!
@AkashKumar-vy7zx6 ай бұрын
Best
@bhargavgadde70686 ай бұрын
if you use loop with in loop time complexitiy is not o(n) anymore
@NHCS_Rohit_Karmakar6 ай бұрын
really the logic was good
@abudanish1966 ай бұрын
This solution will not work in C++
@smitj54047 ай бұрын
great!!
@vanstrihaar7 ай бұрын
Finally, understandable explanation (focused not on what to do but on why to do). Thank you.
@CodersCamp5 ай бұрын
Glad it was helpful!
@balreddya66047 ай бұрын
Thanks alot for the solutions, this channel has awsome explanations.
@KeyAndLock778 ай бұрын
computing isPalindrome for every node in Trie is going to be totally insane and assuming that itself is going to be of order O(n2)
@user-fb5rf8jd4p8 ай бұрын
Thank you very much for your explanation! I struggled for several hours to understand the related article in the Leetcode editorial but it was in vain. Then I found your video and got the idea after the first watch. So simple and clear explanation!
@nikhilkumarjamwal53229 ай бұрын
can you explain with dry run???
@JatinGupta-ze6nc9 ай бұрын
line number 9 m a[] kya hai
@yeeeeetcode9 ай бұрын
You are amazing
@michaelscott18999 ай бұрын
jordar
@tapassaha61139 ай бұрын
Clear explanation.
@sohampatil10799 ай бұрын
You should have provide files
@sachidanandanaik76909 ай бұрын
Great explanation. Could you please explain the time and space complexity?
@furquan59749 ай бұрын
Excellent explaination
@sahajshrestha507010 ай бұрын
Thank you so much for this explanation. I have watched so many solutions videos for combination sum IV and this one explained it the best. It finally makes sense now.
@pamix200410 ай бұрын
Finally, a tutorial that made it easy to follow!
@ananyapurushottam978410 ай бұрын
So clear and helpful!!! Thank you
@sourabh25810 ай бұрын
public int minCostToMoveChips(int[] position) { int even=0,odd=0; for(int i=0;i<position.length;i++) if(position[i]%2==0) even++; else odd++; return Math.min(even,odd); }