Your explanation is the only one that i fully understood out of many videos on KZread for this leetcode question . Thank you so much! keep up the good work ;)

underrated channel ,,your code and explanations are always very easy to understand makes a difficult question easy :)

Thanks🤓, and congrats on reaching 5k subs 🔥.

By far the best explanation of this problem!

Awesome explanation , after spending 2-3hr on yt i found this video. Thanks.

Your Explanation is so amazing, after understand the approach i am able to solve the question 🙏

I have been searching for the best explanation for this problem since 1 month n my search ended unto you...great explanation thankyou soo much...

Thank you for the nice explanation the way you explained the problem literally i felt like it was very understable and simple ...hats off to you!!

after 2 hours your explaination helps me to understand the logic.Many many thanks from my heart

The way you are explaining is amazing .

Indeed you don't have much resourses but still your video content is awesome. Please keep posting such videoes. I will definitely like to contribute for your channel whenever i get placed.

thank you Alisha for explaining this,literly no one can explian better than you..I have seen many youtubers but you are different ,keep it up..

14:32 What if the element that has to be deleted is not on s[end]. for example, as on 8:21, end is on a, but we have to delete the b char from the set, how this 14:32 statement is taking care of this case.

@Viralmems_xyz

Жыл бұрын

because we are not increment the start pointer so again check for start

Thank you very much.. I finally understood the concept 😊😊

Very easy explanation. thank you so much ♥♥

i am studying from your channel, you are the only hope for dsa. Thanks for such amazing content

your videos are beginner friendly.. thank u

very nice memmmm you are a best teacher .. Thanks For Making Good Contain : )

U are doing great work keep it up 👍

superb job liked it ur effort really appreciate it.

good explanation thanks. This is short and crisp to the point. It could have been better if you could explain the intution behind to arrive at the solution.How a candidate can think if he sees similar questions without previously looking at the solution.

your explanation really helped me solve a lot of leetcode problems thank you madam

we can also do by using unorder set with less time complexity

what is the time complexity of this solution O(N) or something greater than this

Thanks for this video you are amazing......

what is the time complexity in this case

thank you very much

great explaination by two pointer

Osm I was doing mistake while erasing from the set But got mistake Thank you

great explanation

can you tell me the name of this playlist

thank you !

I used to think that girls are not good at coding same as driving haha ... But you are amazing ... Really better than others ... your logics are straight forward and easy to understand ... and you use data structure ... Very nice ... Love from Delhi ...

Good Explanation , all case are not passed not handling if character is in between of set

@sanjusingh4842

5 ай бұрын

The char will be removed until it removes the duplicate element.. Try to run the code bro....

great sol thanks Alisha

thanks apu💚

Thanks

Tq somuch❤️❤️❤️❤️

crystal clear

Thanks for the video. Can you share code on Java 8 for longest substring in a given string.

V good 👍👌👏🙌

you're goooooody good

How solve in java eclipse

awesome !!!!!!!

goddess thanks for help

can anybody explain why we did it==Set.end()

Love uhh mam ❣️

Thank you mam

how are you recording video

ty

best exp.

This code is not working for all the test cases

mam you are awesome

nice

Getting wrong output for string "au". It should be 2 but I am getting 3.

❤❤❤❤

I love you

Wow I understand completely.

@creationtechz7408

2 жыл бұрын

I thought that it is java until I realized that it is C++, please include C++ in title.

This is not a Optimum solution it will be more than O(n)

its time complexity is?

@ShivamShukla-op2iq

2 жыл бұрын

time: O(n) space: O(n) where n is the no. of characters in the string.

There is a bug in your code. Please correct that.

sol in c#: public class Solution { public int LengthOfLongestSubstring(string s) { int end = 0; int start = 0; int max = 0; HashSet set = new HashSet(); while(start if(!set.Contains(s[start])) { set.Add(s[start]); max = Math.Max(max, set.Count); start++; } else { end++; start = end; set.Clear(); } } return max; } }

Arshdeep Singh Arshdeep Singh 2 months ago underrated channel ,,your code and explanations are always very easy to understand makes a difficult question easy :) Code with Alisha Reply Satish Gollu Satish Gollu 4 months ago Underrated Channel.. The way you explain the concept is simply splendid. Thanks much for your time and effort. Code with Alisha Reply Madhab Tripathy Madhab Tripathy 1 month ago Your Explanation is so amazing, after understand the approach i am able to solve the question 🙏 Code with Alisha Reply Noober7 Noober7 3 months ago By far the best explanation of this problem! 1 Code with Alisha Reply Ooo Mr. Ki Beautiful Miss Ooo Mr. Ki Beautiful Miss 5 months ago (edited) I used to think that girls are not good at coding same as driving haha ... But you are amazing ... Really better than others ... your logics are straight forward and easy to understand ... and you use data structure ... Very nice ... Love from Delhi ... 1 Code with Alisha Reply Saraswati Rathore Saraswati Rathore 9 months ago The way you are explaining is amazing . Code with Alisha Reply Sweet. Sona Sweet. Sona 3 months ago your videos are beginner friendly.. thank u 1 Reply Abenezer Getachew Abenezer Getachew 3 months ago Your explanation is really good! Code with Alisha Reply 11_H_sudhanshu kumar 11_H_sudhanshu kumar 1 month ago Awesome explanation , after spending 2-3hr on yt i found this video. Thanks. Code with Alisha Reply Apeksha Shinde Apeksha Shinde 6 months ago I have been searching for the best explanation for this problem since 1 month n my search ended unto you...great explanation thankyou soo much... Code with Alisha Reply Jack Sparrow Jack Sparrow 7 months ago U are doing great work keep it up 👍 Code with Alisha Reply Logan Logan 6 months ago (edited) Thanks🤓, and congrats on reaching 5k subs 🔥. Code with Alisha Reply Namrata Dhobale Namrata Dhobale 5 months ago crystal clear Code with Alisha Reply ayush ranjan ayush ranjan 6 months ago what is the time complexity in this case 1 Reply Ashvin Kumhar Ashvin Kumhar 7 months ago great explanation Code with Alisha Reply Rahul Gautam Rahul Gautam 6 months ago great explaination by two pointer Code with Alisha Reply GoogleBaba(404) GoogleBaba(404) 2 months ago (edited) we can also do by using unorder set with less time complexity Reply Muhammad Mohsin Muhammad Mohsin 4 months ago Osm I was doing mistake while erasing from the set But got mistake Thank you Code with Alisha Reply Darshan Kalathiya Darshan Kalathiya 6 months ago very nice memmmm you are a best teacher .. Thanks For Making Good Contain : ) 1 Code with Alisha Reply NIThian NIThian 5 minutes ago Thanks for this video you are amazing...... Reply Alfa Binomial Alfa Binomial 3 months ago awesome !!!!!!! Code with Alisha Reply Rishabh Sharma Rishabh Sharma 2 months ago Java Code : class Solution { public int lengthOfLongestSubstring(String s) { int end = 0; int start = 0; int max = 0; HashSet set = new HashSet(); while(start { if(!set.contains(s.charAt(start))) { set.add(s.charAt(start)); max = Math.max(max, set.size()); start++; } else { end ++; start = end; set.clear(); } } return max; } } Reply Lokesh :The Coding Guy Lokesh :The Coding Guy 6 months ago what is the time complexity of this solution O(N) or something greater than this Reply Idukhan 7239 Idukhan 7239 1 year ago V good 👍👌👏🙌 Code with Alisha Reply PIYUSH PIYUSH 7 months ago can you tell me the name of this playlist Reply Creation Techz Creation Techz 9 months ago Wow I understand completely. 1 Code with Alisha Reply 1 reply Arpita Sur Arpita Sur 5 months ago you're goooooody good Code with Alisha Reply Stranger Is Talking Stranger Is Talking 7 months ago where did you placed in which company? Reply SUBHRADIP BARIK SUBHRADIP BARIK 6 months ago nice Code with Alisha Reply Reshma Parveen Reshma Parveen 1 year ago Tq somuch❤❤❤❤ Code with Alisha Reply Rachit Badoni Rachit Badoni 4 months ago ❤❤❤❤ 1 Code with Alisha Reply Shobhit Vijay Shobhit Vijay 1 year ago goddess thanks for help Code with Alisha Reply nil nil 2 months ago How solve in java eclipse Reply Jayesh Chaurasiya Jayesh Chaurasiya 2 months ago Love uhh mam ❣ Reply Arpita Sur Arpita Sur 5 months ago its time complexity is?

nice