LeetCode 567 | Permutation in String | Solution Explained (Whiteboard + Algorithm in Java)

preview_player
Показать описание
Running Time: O(t)
Space Complexity: O(1)

Always be pluggin:
Рекомендации по теме
Комментарии
Автор

I watched/read several solution explanations and yours is the one I understood
Thank you!

stacy
Автор

Hey Xavier, nice to meet you! I just found your channel and subscribed, love what you're doing!

I like how clear and detailed your explanations are as well as the depth of knowledge you have surrounding the topic! Since I run a tech education channel as well, I love to see fellow Content Creators sharing, educating, and inspiring a large global audience. I wish you the best of luck on your YouTube Journey, can't wait to see you succeed! Your content really stands out and you've put so much thought into your videos!

Cheers, happy holidays, and keep up the great work!

empowercode
Автор

Very readable and understable solution compared to Neetcode''s. His solution with matches confused me. This solution would pass any interview. Good stuff

firehouse
Автор

the best explanation video I came across for this problem as a beginner. Thank you!!

SHRUGX_YT
Автор

THANK YOU FOR THIS! Liked and subscribed

Dennis-enrt
Автор

but i=x here x len =2 doesnt;t it mean the secod for loop starts from index 2 instead of index 1?

シャム-dn
Автор

Why is the second if condition outside the for loop, won't the last iteration check it regardless?

recessionriche
Автор

Elon your explanations are always on point I'll always recommend it to my friends.. Please there is a popular problem cheapest flight withing k stops, ive tried many resources but dont understand how to solve...please can you attempt it on this channel when you are free?

tochukwuokey-munonye
visit shbcf.ru