Відео

Great🔥🫡

THANKS!

🔥🔥🫡

We can use a hashset instead of a hashmap, because we aren't using the values in the hashmap in any way.

Subbed🙌🔥

Thank you!

Nice, my pretty version 192ms: ua-cam.com/video/u5ttDKBDGJw/v-deo.html ^^

class Solution: def makeFancyString(self, s: str) -> str: result = [] for char in s: if len(result) < 2 or not (result[-1] == char and result[-2] == char): result.append(char) return ''.join(result)

I really like your videos. Any resource recommendations where you've learned from?

The only explanation that helped me actually understand what is going on, Thanks!

Really good

I like your solution! Thanks for the explained drawings

Good explanation!

Very well explained! Thank you!

Thank you so much for great explanation. I love watching your videos. Much appreciated!

She deserves way more subscribers than she has optimized and creative solution as always 💯

thank you

Good job

Great explanation. This algorithm can be directly applied to the LeetCode problem 2406.

Nice explanation. The nested call to set() function will make the overall complexity O(n * minLength)

You're the best

Amazing vid + i learned something new on how to work with queues. You got a subscriber

Underrated channel. I love these! Thank you :)

Brilliant. Thank you for putting it together.

This question was diffuclt for me, I understood we needed a prefix sum and I could see similiarties to two sum but when i began writing down the solution on paper my brain just cramped. The solutions on leetcode were not helping either. I'm glad I found your video! it was very clear, I may have to watch a few times to gain some of intution you have. Thanks!

Thank you so much for great content. I love watching your solutions, so easy to follow!

Absolute exaplanation !! Thank you

Amazing explanation thank you

Awesome explanation

Thank you!

Whoever made this problem I hope both sides of your pillow are warm

Hi, thanks for the solution. However, it doesn't seem to work any more for some test cases. For the two test cases below, if you change the order of the two for-loop, one of them will fail. [[2, 1, 1, 1, 1, 2, 2, 1, 0], [0, 0, 1, 2, 0, 0, 0, 2, 2], [2, 0, 2, 2, 1, 2, 1, 0, 0]] [[2, 3, 0, 0, 1, 0, 1, 2, 1], [0, 1, 3, 3, 0, 0, 2, 2, 0]]

Good One, keep this up

thank you for this

what happen if the two monkey swap there place in case of even number vertex, isn't other possibility to avoid a collision?

Nice explanation!

thank you

where does actual backtracking happens in code?

That was an incredible explanation

Superb Explanation

which drawing device you are using?

such an amazing soln. How did you come up with the last return statement. That line is magical

thank you and love from India

Hey Bro Youre Arab right? Nice Explaination by the way.

NICE SUPER EXCELLENT MOTIVATED

so it means i was able to solve 90% of this problem on my own but i rather than dividing c/e[0], i was doing every loop which gave me tle. and whole time during contest i was thinking how to even convert it into O(N) 🙂

thanks!!

No idea about the other solutions you've solved. But this one is really simplified and nice way to explain. You've made it piece of cake and I was able to solve few other hard Leetcode questions with simply by swaps. Keep it up don't worry about number of views or comments. Cheers

good explanation

best video for this problem ! thhanks