วีดีโอ

Nice video bro

Nice video bro

I subscribed ,good !on new year day u doing coding , no one can stop you ! Keep it up !!

Nice explanation

import java.util.*; class telugu{ public static int Replacement(String s,int k){ HashMap<Character,Integer> hm =new HashMap<>(); int l=0; int maxF=0; int maxL=0; for(int r=0;r<s.length();r++){ char ch=s.charAt(r); hm.put(ch,hm.getOrDefault(ch, 0)+1); maxF=Math.max(hm.get(ch),maxF); if(r-l+1-maxF<=k){ maxL=r-l+1; }else{ while((r-l+1)-maxF>k){ char ch1 =s.charAt(l); hm.put(ch1,hm.getOrDefault(ch1,0)-1); if(hm.get(ch1)==0){ hm.remove(ch1); } l++; } } } return maxL; } public static void main(String[] args){ String s="ABAA"; int k=0; System.out.println(Replacement(s, k)); } } solution in java

Wonderful explanation the way you are explaining 😎🤏 fantastic keep going

Do not stop this series

Excellent explanation❤❤❤

anna miru different approaches vadthunnaru and vatiki code kuda chupinchi oka 1 min explanation isthe chala bavuntadhi and useful untdhi anna.

❤

broo order to patu bytes lo kuda cheppandiii

Thankyou for the content, looks amazing. Is it possible to share java example of model-2 approach (moving of first and last pointers to right by cleverly eliminating elements)?

Brute Force : int main() { string s; cin>>s; int k; cin>>k; int n = s.size(); int Max = 0; for(int i=0;i<n;i++) { unordered_map<int,int>m; int Maxfreq = 0; for(int j=i;j<n;j++) { m[s[j]]++; Maxfreq = max(Maxfreq,m[s[j]]); if(((j-i+1)-Maxfreq)>k) { break; } Max = max(Max,(j-i+1)); } } cout<<Max; } Time Complexcity : O(n^2) Optimized Code : int characterReplacement(string s, int k) { int n = s.size(); int Max = 0; unordered_map<int,int>m; int l=0; int r=0; int Maxfreq=0; while(r<n) { m[s[r]]++; Maxfreq = max(Maxfreq,m[s[r]]); while(((r-l+1)-Maxfreq)>k) { m[s[l]]--; Maxfreq = max(Maxfreq,m[s[l]]); l++; } Max = max(Max,(r-l+1)); r++; } return Max; } Time Complexcity : O(n)

speechlesss ,one of the best explanations in youtube. please continue the theory like this ,it gives confidence

Hey, Thank you, Was really looking forward for this video.... :)

Explanation superb bro pls continue series fast upload

As possible as possible 4 months lo complete chei anna interviews vasthunai

Anna nuvvu views kuncham thakkuva vasthunnay ani videos apaku your videos are really helping me soo muchh anna

Endi bro.. ateey poenav..

Thanks bro.. Nice explanation👍

Good Explanation bro

🔥 Atleast release 2 videos per week

Vere level explanation 🎉🎉 New trails work outing😊 Blocking board with flash quote😅

happy new year anna

Happy new year Anna 🎉

I remember doing this problem for the first time. appudu appudu nen endhuku puttinana ani anipinchindhi 😂. anyways u explained it really well anna. happy new year

Nice explanation anna 👍 Please anna DSA series continue cheyandi it is very helpful for tech job aspirants 🙂

very great explanation bro views ravatledhu ani videos cheyyadam apaku bro we will support

annaya vachadu annaya ochaduu

Happy new year 🎊 lokesh anna Chala late ayindhi But parledhu I am waiting for your videos I hope you are doing great in your masters 😊🎉🎉❤

Happy New Year 🎊🎊

After A Loong Loooooong Time_ Anyways, Literally Very Much Excited To See U Again Broo_

Anna Ochinnduu 🔥🔥

Anna supper cheppav asla ❤

Best channel to learn dsa in telugu ❤🔥

Way of teaching nice easy excellent great

Emana chepinav bro 👏

please write exact code without mistakes even colon or semicolon

what is the difference between Normal set and HashSet, both are same or not?