Man are you coming back😮?

A small mistake in 7:19 where Current Area = 7 * min(8, 7) --> 8 * 7 --> 49 The final value is correct so would classify the 8 as a typo

Great visualization. The second condition is quite unintuitive. Usually you skip when a number IS used, this goes against that.. but somehow it works.

Damm what a solution !

Thank you sir for the wonderful video sir

Can you recommend a resource to understand linked list

can u try in dart code :D

💪🗿🔥

Nice and simple thanks

Woo hoo 🎉 you are back🔥🫡

Man why are you not uploading please don't leave KZbin😢😢

👏🙌🙏

me laughing in -~-~-~5

Ahhhhhhhhh😮!!!! clear explanation with a nice animation, thanks Zi!!!

super usefull for logic building 💥💥

Thank you sir for the wonderful video sir

Learnt it when learning idris lang.

Awesome 😊

interesting

Would be better if you referenced that this is called the Boyer-Moore majority vote algorithm. A possible extension would also be if there is no guaranteed majority element, a second pass would be needed to count occurrences of the candidate.

(l+r)/2 can cause numeric exception instead use l+(r-l)/2

var input = [1,2,3,4]; var output = []; var inLength = input.length; for(var indx = 0 ; indx < inLength; indx++) { var mult = 1; $.each(input,function(i,x){ if(i != indx){ mult *= x; } }) output.push(mult); } console.log('result is ', output);

next level visualisation🔥🔥🫡

This is good explanation, keep it up! ❤🙌

Can we not get product of all elements ans while iterating divide by current element and save in result ?

Great video

Great explanation, thanks for the animation!

Thank you for the wonderful video sir you explained it in a very easy way, thanks again sir

Why don't you use 2 pointers(head and tail of the list) and consider only applicable chars?

100th video! Congrats for many more successful videos🎉🎉🎉

Woww you've hit 1k! Congratulations..was away for a while.

set(range(n)-set(given))

Thank you sir for the wonderful video

Very good explanation thank you for your dedication and for helping us 😊

Becoming a Big fan of your explanations!!! Thanks and pls keep the good work!!

since the Map is likely to be shorter than the original string, I thought it might be interesting to loop through the Map for the second loop function firstUnique( wrd ) { let dict = new Map() let n = wrd.length let lowestIndex = 100000 for( let i= 0; i < n; i++ ) dict.set(wrd[i], dict.has(wrd[i])? -1: i) for( const indx of dict.values() ) if( indx >= 0 && indx < lowestIndex ) lowestIndex = indx; return (lowestIndex === 100000)? -1: lowestIndex; } this could probably be optimized a bit further but this was just for fun

Thank you sir for the wonderful video

Thank you sir for the wonderful video one more question sir for the reversal of the string if question is given as not to use default methods provided by programming language what approach will you take do you manually loop through it or use recurssion to reverse the string do please let me know sir thank you

Underrated af

Nice video. Do you have any discord community or x community? Would Love to connect

Awesome video man, can you also make dsa for JavaScript pls 🙏

Good explanation keep it up ❤

Great man , i think you are the only person who teaches DSA in JS on YT

It's beside the point, but that graph is both not to scale and bends the wrong way 😂

Great video man, keep it going