2 жыл бұрын
2 жыл бұрын
2 жыл бұрын
2 жыл бұрын
2 жыл бұрын
2 жыл бұрын
Пікірлер
@jaurestchoudji9970 Күн бұрын
Cool cool and so cool 🎉
@sword013 2 күн бұрын
All the good animation and it leads to wrong code..
@angpanha3566 2 күн бұрын
can the fisher-yates shuffle start from the first index as long as we keep track of the unshuffled and shuffled part correctly?
@ehapahmed1069 3 күн бұрын
your explanation is just simply brilliant ... I love it
@Vipin_iitd 6 күн бұрын
Excellent !!
@GolDRoger-ss1co 6 күн бұрын
most intuitive explaination out there
@idocoding2003 7 күн бұрын
❤❤❤❤❤❤ wowww
@ShaeekhShuvro 7 күн бұрын
Best analysis!
@manim4434 16 күн бұрын
Thank you, it was the best
@soumyasmruti 16 күн бұрын
No
@youngKOkid1 19 күн бұрын
Great video.
@k.k.harjeeth5422 20 күн бұрын
THANKS !!!
@AliMurtaza-ew3lh 21 күн бұрын
beautifully put.
@faysalbotan2535 23 күн бұрын
It have 16 subsets
@footballlive5311 24 күн бұрын
They could be in the same grid and they are not neighbors at d = r✓2
@sampathsubasinghe929 25 күн бұрын
Awesome explanations, keep up the good job, dude !
@aspiretechie1191 27 күн бұрын
Recursion is the base algo you need to master before learning trees, If you are good at recursion then trees is nothing.
@mohammedhajomar4400 28 күн бұрын
deserves 1million views. Thanks a lot. Great animation
@HimanshuTheHR 29 күн бұрын
Think of the relative speed of 2 nodes , one has speed of 2 nodes and other has speed of 1 node . The relative speed is always 1 , meaning the distance between the slow pointer and the fast pointer will always keep reducing to 1 node after they have entered the cycle. That means they will eventually meet and never jump over because at one point the distance is reducing by 1 and not 2 or more to jump over.
@germanrud4541 29 күн бұрын
what is the complexity of this kind of algorithms?
@germanrud4541 29 күн бұрын
awesome, thxxxxx
@AliHemati-t5e 29 күн бұрын
The best explanation I've ever seen. Thank you very much❤
@billiardoxx Ай бұрын
very well explained 👏👏
@udaykulkarni5639 Ай бұрын
1 min in the video and subscribed already!! Good stuff man
@yusufbulbul7100 Ай бұрын
great explanation. thank you.
@butoyighyslain171 Ай бұрын
amazing stuff man!
@卞不变 Ай бұрын
A very good and well-made vedio, but there was a mistake at 4:07, it should be 'less than' if clockwise, but both were 'greater than' in this vedio.
@internetandcomputerprobe4426 Ай бұрын
Really Informative
@adityajivoji2130 Ай бұрын
There is a mistake at 2;28, it should be oo, ou and uu
@jumpsneak Ай бұрын
No sound???
@PiyushChauhan2011 Ай бұрын
Best explanation of KMP Intuition after studying so many of them. Thank you
@durgakaruturi3407 Ай бұрын
Why do we need to create ysorted_left and ysorted_right if we are using just ysorted for in_band construction
@Ffatima79 Ай бұрын
thank you this is so useful ,god bless you
@ayaskanta100 Ай бұрын
no one mentioned why they are using -1 multiplication in python except this video brilliant
@anniamatthews6803 Ай бұрын
great explanation! you made this very simple
@monoman4083 Ай бұрын
nice...
@halildurmaz7827 Ай бұрын
I liked your clear explanations. However, the 3rd solution is not understandable, if you don't know the related concept. Also, a note: 2:50 "n=len(arr)" line is redundant actually. In the "return" line, just use "negative indexing" ---> arr[-k]
@khelilikhouloud7062 Ай бұрын
Wt abt subtraction sir
@Scar32 Ай бұрын
DFS looks like it's a good algorithm for a pen plotter fill algorithm like the way it snakes across the image to fill it is just wonderful!
@ShivamKadam-bc4dn Ай бұрын
2.07
@ShivamKadam-bc4dn Ай бұрын
2:07
@anishbhandari4699 Ай бұрын
In duplicate number 9th node should point to 2nd node not to 7th node
@stazchristo Ай бұрын
Great Heap Video and Great Visualizations, Thanks!
@charles7684 Ай бұрын
best explanation
@devmahad Ай бұрын
thanks :)
@fergalhennessy775 Ай бұрын
What if corner?!
@asunthakeded4967 Ай бұрын
sliding window made very very easier. Now I will be able to solve 80% of the problem related to sliding easily without thinking much and by visualizing
@arnoldepanda9426 Ай бұрын
do you have a website content?
@justusschoenmakers8987 Ай бұрын
you can speed the process up with symmetry. rotating the board doesnt change if the solution is valid. therefore when youre done checking a square youre also done checking 4 other squares. eg: you start on h8, when the recursion falls back you have also checked for a8, a1, h1. there are no other symmetries because you are litterally filtering them out in the first place, so only speed up by 4. but its really easy to implement.
@bgidcik Ай бұрын
correct if im wrong, in rec() during each recursion the nb_solution becomes zero and it mess up the solution
@Ranju_ganiga_7 Ай бұрын
Short and sweet 👍
@user-sj6og7wi2q Ай бұрын
FINALLY I SOLVED THIS SHI