Видео

str=input("enter an value : ") rev="" for i in str: rev=i+rev print(rev) if str==rev: print("yes it is an palindrome") else: print("No it is not an palindrome")

Nuv makku dorikina god vi macha ellane makku support chey

Macha macha macha . nuvvu thop macha , innalu ekkada unnav macha , nuvvu job manesina parledu ma kosam matram daily DSA videos cheyyali macha...............................

thanks macha , chesesa

Bro how to apply for MNC tier 3 clg vedio membership aduguthandhe bro

Participants list link pettachu ga bro it will be helpful

Macha oka request macha eppudu ninnu adagaledhu . Konchem speed ga cheppava dsa . Length increase cheyyava macha please atleast oka video one hr cheppu macha ekkuva cover avuthay . Makosam time thisukoni please macha . Nuvvu two languages cheppakapoyina parle . Okati cheppi adhi complete ayyaka enkokati cheppina no problem but makosam konchem speed increase chey macha chalu

def devara(): print("yethi yevaru") print ("kansar ka salaar") devara() print("where is janvi") devara()

class Solution { public String defangIPaddr(String address) { String ans=address.replace(".","[.]"); return ans; } }

Participation list link pettochu kada bro Video lo ma name find cheyaleka pothunnam I hope next time link pedathav anukuntunna

class HelloWorld { public static void main(String[] args) { int[] arr={12,1,3,1,1,6,7,1,8,1}; int temp=0; int ans=0; int k=2; int l=0; for(int r=0;r<arr.length;r++){ if(arr[r]%2!=0){ temp++; } while(temp>k){ if(arr[l]%2!=0){ temp--; } l++; ans=Math.max(ans,r-l+1); } } System.out.println(ans); } }

n=len(stones) ans=0 for i in range(n): if stones[i] in jewels: ans+=1 return ans

Joyboy from VVIT here, got the price when the link has ZORO. I see some connection.

Waiting for step-02 bro.

Super explaination bro.!

I'm in part 36. For those who are thinking whether to watch this playlist or not, "GO FOR IT" guys..!!! It's worth it to watch this.

Anna I am Mani from Govt Polytechnic Nizamabad. Ni videos vallane nen coding cheyagalugutunna anna . Thank u so much anna .

Nice 👍 macha

astonishing broo

bhayya idi functions vadinapudu self parameter pacca use cheyali kadha?

Bro im at the most recent video like 36th one ! And trust me he did some magic and made me solve problems by my own ! Just follow aipo macha mana vignesh vro ni ! You'll just rock anthe !!!

Bro okati cheppava.! Ee speed lo velthe manaki DSA avvataniki ntha tym pattochu ? Dhani batti migathavi plan cheskuntanu like web dev, and projects ala !! 'coz ippudu fast ga aipoddi ani anukoni I left them all to continue after this DSA . So idhi okati clarity ivvu approx tym . And inkoti kuda ee course ayyepatiki inka DSA lo thop aipotha kadha ? 🥺 Chala hopes unnay bro Mee meedha !

# Decode My Name key = 'the quick brown fox jumps over the lazy dog' dic = {} temp = 97 for i in key: if i != ' ' and i not in dic: dic[i] = chr(temp) temp += 1 #print(dic) message = 'ctfusk' ans = '' for i in message: if i == ' ': ans += ' ' else: ans += dic[i] print(ans)

Bro in how many days will you start recursion, backtracking,dp, linked list etc

class Solution { public int maxConsecutiveAnswers(String answerKey, int k) { int tCnt=0; int fCnt=0; int l=0; int maxconseqLen=0; for(int r=0;r<answerKey.length();r++){ if(answerKey.charAt(r) == 'T'){ tCnt+=1; } else{ fCnt+=1; } while(Math.min(tCnt,fCnt) > k){ if(answerKey.charAt(l) =='T'){ tCnt-=1; } else{ fCnt-=1; } l++; } if(Math.min(tCnt,fCnt) <= k){ maxconseqLen=Math.max(r-l+1,maxconseqLen); } } return maxconseqLen; } }

What a teaching and what an explanation..! Mind lo nunchi povadam ledhu...Hats off to way of teaching....

Good clarity of ml students

ithe 10mins lo 1cr sampadhinchi video chai

ee series worth machas.

Aug 30 na start chesa bro course frnd suggest chesthe. After watching the 1st video itself consistently watching your videos and following the instructions given by u like pausing the video and working on the problem for 20 min or more than 20 min and after that resuming the video and I am in part 36 now which is the latest one...meru explain chese way is superb bro like explaining in a structured way... Finally I am enjoying learning 😊by watching dsa series explaining by u... Edi varaku chala videos chusa bro edo oka daggara struck ayyi inka I stop watching there itself...But I never stop watching this series because of ur excellent explanation and end of the video I am with no confusion.....Inka em cheppalo teliyatle bro.... finally Thank you so much for providing this wonderful course with easy explanation....🎉

Bro so many days , still on arrays ,2 pointers technique

class Solution { public int lengthOfLongestSubstring(String s) { HashSet<Character> set = new HashSet<>(); int l = 0; int maxlen = 0; for(int r = 0; r<s.length(); r++) { if(!set.contains(s.charAt(r))) { set.add(s.charAt(r)); // a b c } else { while(set.contains(s.charAt(r))) { // a b c set.remove(s.charAt(l)); // b c l++; } set.add(s.charAt(r)); // b c a } maxlen = Math.max(maxlen, r - l + 1); } return maxlen; } } time given 20 mins time i took is 32 mins

class Solution { public int lengthOfLongestSubstring(String s) { HashSet<Character> hs = new HashSet<>(); int n = s.length(); int left = 0; int max = 0; for(int r=0; r<n; r++){ char ch = s.charAt(r); while(hs.contains(ch)){ char ch1 = s.charAt(left); hs.remove(ch1); left++; } hs.add(ch); max = Math.max(max,r-left+1); } return max; } }

Present I am in part 36 Dsa couse such a wonderful explanation u can't get even you paid money, here it's all free keep support the channel for his Hardwork

Chala late avuthadhi ga bro Ela ayithe DSA . Okka video 20 minutes . Enka starting lone unnam. December ki expect chesam kani edhi next year varuku vellala vundhi 😢😢😢😢😢. Sorry bro ninnu ibbandhi peduthunnanaduku but we expected lot from you . Chala youtubers starting lone konchem cheppi vellipotharu best example kunal DSA. Nuvvu matram ala cheyyav anukuntunnam . Literally ninnu chala nammam

3 hrs video annav ga bro 😢😢😢😢😢😢😢😢😢😢😢😢😢😢😢😢😢😢😢😢😢😢😢

bro pls upload 2 videos daily

Intha baga chepthunnav but Veiws nti macha ila osthunnaii 😑

Hi Macha nenu ipudu part-36 lo unna, nee teaching chaala baagundhi macha difficult gaa unna problems ni kudaa easy gaa artham ayye laaga nerpisthunnav, nenu inkaa naa laanti chaala mandhi nee videos kosam consistent gaa DSA course complete ayye varuku wait chesthaam, alaage nuvvu chepina probelms ni practice chesthu untaam, oka vishayam chepthunna machaa nuvvu chesthunna ee help ki, you are always in good place and thank you sooo much macha, maa kosam nuvvu nee time spend chesi nerpisthunnav. Nuvvu illage consistent gaa videos chey macha mem neeku support gaa untaam. 🤝🤝......

🤩🤩

complete cheyyandi bro tondaraga daily 2 videos aina upload cheyyandi..pls

str="HARIKA" h=len(str) for i in range(h-1,-1,-1): print(str[i],end="") output:AKIRAH

Anna when is this series going to complete in java.

Vere level anna i solved my own medium que class Solution { public int numOfSubarrays(int[] arr, int k, int threshold) { int l=0; int ans=0; int temp=0; int n = arr.length; for(int r =0;r<n;r++){ temp+=arr[r]; if(r-l==k){ temp-=arr[l]; l++; } if(r-l+1==k){ int avg = temp/k; if(avg>=threshold){ ans++; } } } return ans; } } After this i realized easy medium hard are just hypothetical knowing concept makes every problem easy

Anna c program videos pattu anna

Ilanti websites chesi maku chala help chestunnaru macha tq a lot ❤❤❤

Website ekkada deploy chesavu bro.

def table(tablenumber,count): for i in range(1, count+1): print(f"{tablenumber}x{i}={tablenumber*i}") table(20,20)

Make more videos on dp,graphs

Bro meru create cheysina e website upload cheyyandi bro so that maku chala use avtadi , I already searched ur website but andulo except JAVA series inkemi levu , upload cheyyandi bro