Longest Substring Without Repeating Characters - Leetcode 3 | Python | Hindi

preview_player
Показать описание
Leetcode Problems / Leetcode Solutions / Leetcode Python / Leetcode Playlist / Python / Leetcode

#leetcode #python
Рекомендации по теме
Комментарии
Автор

after 12 hrs of referring various videos and ended my search here what a video detailed solution . and more focused on concept rather than code. amazing video!!

khaleabhishek
Автор

Hi Rohit, I watched similar problem's solution in other youtuber's channel as well who are having more subscribers but trust me this was the only video which helped me understand, you have a great teacher in you, the ability to break things down and explain in a very simple way so please do not stop making videos and keep this up.
Hoping for more Leet code videos on arrays, strings, etc.
Thank you so much!

parthasarathibarman
Автор

So easily explained that too in hindi.. Please continue this series

rafipasha
Автор

This is the best explanation i ever came thru..

However,
the st<= d[v], this should nt be required, cause the dictionary cant have duplicate keys, evrytime you are puting d[v]=i, it will update the previous key value if exsists.. please let me know your thoughts..

neelbanerjee
Автор

First comment lighting is Perfect 👍👍👍 Wasa kya jugad lagaya

scaryboy
Автор

in this method we are not dealing with substring we are just dealing with characters that its repeating or not and then we just counting the unique elements in this method. but we to deal with substring

chandraj
Автор

Awesome video!
Thanks for all the content.

shuvamchaturvedi
Автор

bahiya ye bhi ho sakta he
s = set(("abcabcabc"))
print(len(s))

navalprakash
Автор

sub string or sub sequence phele batana chaiye uske baad.code....

abhishekprakash
Автор

College me teachers itta acha kyo nai padhate..

manishkedia
Автор

Sir please, you upload one or more videos daily. We have subscribed your channel.🙏❤🙏

sharmaji...
welcome to shbcf.ru