Longest sub string without repeating characters [TAMIL] | Sliding window algorithm

As part of the interview preparation series, today we will see the sliding window technique to solve the longest sub-string without repeating the character program in leet code. For example, the longest substrings without repeating characters for “ABDEFGABEF” are “BDEFGA” and “DEFGAB”, with length 6. For “BBBB” the longest substring is “B”, with length 1. The desired time complexity is O(n) where n is the length of the string.

[@pradeeshtet]

In hashMap put the character along with index so that we can directly move j to index without need of while loop

[@sivas4207]

bro I have watched many tutorials for this leetcode problem but couldn't come up with the answer .. but this video helped and cleared all my doubts. Thank you so much, dude!!

[@kumaresanperumal2581]

I understood sliding window concept Thank you very much bro.

[@apjsankar]

Thanks so much for sharing!! Code looks super cleaning and easy to understand! You deserve more n more subscribers :) btw I'm a php developer;)

[@pradeeshtet]

Thanks. I always try to explain the concept clearly so that ppl who knw any programming language can able to solve it at the end. Now, from ur feedback I got to knw that it worked.

[@chandrakumara6534]

Nice Explanation bro. Thank you !

[@chandrakumara6534]

could you share the leed code link in the comment section so that we can use the link and try from our end . It will helpful. Thank you !