Bathroom lo kuda vethikava mowa. Billa u changed billa😂😂

Hi Bharat, Could make video on "Minimize the Heights II" problem.

In my way you are best teacher to teach those concepts in easy manner. Thank you for sharing knowledge in better way. After seeing these videos may DSA is one of the easy.

Thankyou anna Job vachesthundhi

Dsa

Upload the next videos bro, eagerly waiting😢

bro plz do videos..... previous videoes chala baga artham iyyyaaa.... eppudhu 4th yr nenu it will definetinly help me in my placement

anna upload next videos

Freshers ki resume ela undalo cheppu ana campus placements ki ...URGENT

bro can you please upload the next videos

videos continue chey bro

Anna waiting for ur videos

next video epudu vastundi bro?, if possible week ki 3 videos pettandi bro

Where is striver a-z algorithms list?

Bro One small doubt in pseudo code line 13 Is it K -= 1 or k+=1

bro please do 3 videos per week ❤

2 pointer sort code bro&explain is good

class Solution { public int lengthOfLongestSubstring(String s) { int max_len=0; int i=0; Hashset<Character> set=new Hashset<Character>(); for(int j=0;j<s.length();j++) { while (set.contains(s.CharAt(s(j)))) { set.remove(s.CharAt(s(i))); i+=1; } set.add(s.CharAt(s(j))); max_len=Math.max(max_len,j-i+1); } return max_len ; } } Main.java:13: error: cannot find symbol Hashset<Character> set=new Hashset<Character>(); ^ symbol: class Hashset location: class Main.Solution anna ela error vasthundhi artham kaledhu yendhuku vasthundhi ee error ani

Scholarship

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

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

Anna explanation neat,clarity ga undi. Elantivi Inka pettu Anna

love u bro .... telugu community ki DSA kastalu teerinatte mee chaneel tho....... plz don't stop until this is enough to reach DSA advance

Super bro

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

Nice explanation with real time examples Brother. and Thanks for forgetting Laptop in Kitchen, that brought the whole explanation for HASHMAP/HASHSET Thanks for the video and keep posting

class Solution: def maxProfit(self, prices: List[int]) -> int: prefix=[0]*len(prices) prefix[0]=prices[0] for i in range(1,len(prices)): res=min(prices[i],prefix[i-1]) prefix[i]=res maz=0 for i in range(1,len(prices)): if prices[i]-prefix[i-1]>maz: maz=prices[i]-prefix[i-1] return maz this is my another code by own thinking

def isValidSudoku(self, board: List[List[str]]) -> bool: for i in range(len(board)): row_check=[] col_check=[] for j in range(len(board)): if board[i][j]!=".": if board[i][j] in row_check: return False row_check.append(board[i][j]) if board[j][i]!=".": if board[j][i] in col_check: return False col_check.append(board[j][i]) start_row=start=0 row_end=col_end=3 for i in range(3): for _ in range(3): temp=[] for j in range(start_row,row_end): for k in range(start,col_end): if board[j][k]!=".": if board[j][k] in temp: return False temp.append(board[j][k]) start+=3 col_end+=3 start_row+=3 row_end+=3 start=0 col_end=3 return True Bro ee code ki leetcode lo O(1) time complexity ani istundi , is it true?

bro...........binary search video cheyandhi

anna first question start chesemundhu meru aa question ni neetcode platform lo chupinchi tharvatha white board medha chepandi appudu memu aa question ni artham chesukonni memu try chese motham video chustham

def decode(self, s: str) -> List[str]: i=0 t='' result=[] while (i < len(s)): flag=0 j=i if s[j]=="#": length_ss=int(t) cur=0 s1='' while(cur<length_ss): j+=1 s1+=s[j] cur+=1 result.append(s1) flag=1 if flag==1: t='' else: t+=s[j] j+=1 i=j return result Bro dini time complexity O(n**2) or O (n * l)

Bro expalination peaks but code tho step by step explain cheyy 🙏

Bharat, love babbar 450 questions kuda solve cheyava, this would be great help for future generations.

Well explained on two sum problem statement, tq Bharat

Hi Bharath Chandra, 2 unavailable videos hidden.

My doubt In for loop, syntax is * for i in range (start, end, step): -In this end = 10 then it gives 9 is end th element . -In this problem y we use len(nums) instead of len(nums)+1

superb explanation anna👍

Next videos fast ga pettu bro

Day -3 ✅ java brute force : class Solution { public int[] twoSum(int[] nums, int target) { for ( int i = 0 ; i < nums.length ; i ++) { for ( int j = i + 1 ; j < nums.length ; j ++) { if ( nums[i] + nums [j] == target ) { return new int[] { i, j }; } } } return null ; } }

Linked list explain plz😢

very good way of explanation thank you bro .

#optimal approach prices = [7, 1, 5, 3, 6, 4] n = len(prices) maxprofit = 0 i = 0 j = 1 while j < n: if prices[j] - prices[i] > maxprofit: maxprofit = prices[j] - prices[i] if prices[j] < prices[i]: i = j j += 1 print(maxprofit) # Output: 5

#brute force approach arr=[7 , 1, 5, 3, 6, 4] n=len(arr) maxprofit=0 for i in range(0,n-1): #loop for buying day for j in range(i+1,n): #loop for selling down profit=arr[j]-arr[i] #profit=selling price- buying price maxprofit=max(maxprofit,profit) #updating profit print(maxprofit)

int mini=INT_MAX; for(int i=0;i<n;i++) { ans=max(ans,arr[i]-mini); mini=min(arr[i],mini); } return ans;

a=[3,1,0,2,1,0,1,3,2,1,2,3] m=0 #level by level water for i in range(1,max(a)+1): k=i #check every unit area for j in range(len(a)): if(i<=a[j]): if(j!=a.index(i) and j-k!=1): if j>=k: m=m+j-k-1 else: m=m+k-j-1 k=j else: k=j print(m) Water filling level by level genaral approach 😅

Hi Anna iam Java developer looking for freelancing jobs as Java developer could you please share info

Hi Anna o(n3 ) undi kada 9:13 could you please explain in detail

Hi Anna, Meeku telisina Python dsa youtube channel suggest cheyara

bro last approach ardam kaaledu bro🙄😥

hi anna rough ga enii days padhuthundiii dsa complete cheyadaniki and knch ma kosam daily vedios upload chey anna.....alage 3rd year vallaki oka guidance or roadmap la pettandiii anna...