@sivanms918

Bro its been more than a month...come back quickly bro

@coprothin7896

Comeback master we are we need your precious time ❤ 
We love enjoying your content, you are Making us better with every video , i hope you will become very good youtuber in feature lots of strength and love master ❤

@ganibhai8594

Best channel to learn dsa in telugu ❤🔥

@YamunaAngadi

anna we are eagerly waiting please respond to this and we need to continue the playlist

@YamunaAngadi

we are addicted to ur teaching the way u are  explaining ,may be this will help our lives in better manner and that helps us to remove the fear towards the coding and due to the playlist discontinued may be audience will shift to the other youtube channels, please we are connected to ur teaching methodology and we need a quick respond through video

@Asusrog-u9e

Brute force approach
lass Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        max_length=0
        for i in range(0,len(s)):
            for j in range(i,len(s)):
                hashset=set()
                flag=True
                for k in range(i,j+1):
                    if s[k] in hashset:
                        flag=False
                        break
                    hashset.add(s[k])
                if flag==True:
                    max_length=max(max_length,j-i+1)
        return max_length

@SivaTechVerse

bro please do 3 videos per week ❤

@YamunaAngadi

anna waiting eagerly for ur videos please give some updates anna

@YamunaAngadi

anna waiting to listen ur voice and please update the playlist

@YamunaAngadi

anna waiting for ur videos please keep atleast one video in this week

@yamunaangadi538

Anna yenti anna asallu consistency ga cheyandi I am depended on u anna and forgetted to say BELATED HAPPY RAKSHA BANDHAN 😊

@hiteshkumarreddy5901

next video epudu pedtaru bro?

@Asusrog-u9e

sliding window approach
class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        i=0
        max_length=0
        hashset=set()
        for j in range(0,len(s)):
            while s[j] in hashset:
                hashset.remove(s[i])
                i+=1
            hashset.add(s[j])
            max_length=max(max_length,j-i+1)
        return max_length

@shravanakarapu7660

please write exact code without mistakes even colon or semicolon

@nadavalaashok4061

need more videos bro

@gpraneeth7693

Adhaina chesina problem ekuva days gurtu vundali ante ela 
Tips evu anna plz

@ManojKumarChittimeni

Brooo Waiting for Ur Videos_
Nee videos Chusutuney Naa Leetcode JOURNEY Ni start Chesa_

@Venky-o1f

bro..waiting for your video bro!!!

@balu9949

Super bro

@prasadperfect410

Upload the next videos bro, eagerly waiting😢