Bathroom lo kuda vethikava mowa. Billa u changed billa😂😂
@shaikhanuman80124 күн бұрын
Hi Bharat, Could make video on "Minimize the Heights II" problem.
@jahnavikanubaddi84185 күн бұрын
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.
@vaneetha_here_navaneetha5 күн бұрын
Thankyou anna Job vachesthundhi
@hgk10216 күн бұрын
Dsa
@prasadperfect4107 күн бұрын
Upload the next videos bro, eagerly waiting😢
@bharathh_chandraa5 күн бұрын
konchem gap ochindi. Malli start chestha Prasad videos
@meghanareddy42098 күн бұрын
bro plz do videos..... previous videoes chala baga artham iyyyaaa.... eppudhu 4th yr nenu it will definetinly help me in my placement
@bharathh_chandraa5 күн бұрын
Konchem break vachindi Meghana, will start uploading again soon!
@meruvadharani45798 күн бұрын
anna upload next videos
@yaminibalaraju46219 күн бұрын
Freshers ki resume ela undalo cheppu ana campus placements ki ...URGENT
@user-pi6hc9dw3j9 күн бұрын
bro can you please upload the next videos
@bharathh_chandraa5 күн бұрын
Next daani meedha work chestha Venky!
@SivaKona-lr9hb10 күн бұрын
videos continue chey bro
@YamunaAngadi10 күн бұрын
Anna waiting for ur videos
@bharathh_chandraa5 күн бұрын
Working on the next video now!
@hiteshkumarreddy590111 күн бұрын
next video epudu vastundi bro?, if possible week ki 3 videos pettandi bro
@bharathh_chandraa5 күн бұрын
Schedule chaala packed aipotundi Hitesh, will try my best
@lovetheentertainment994912 күн бұрын
Where is striver a-z algorithms list?
@VenkataSaiM-xe5ki12 күн бұрын
Bro One small doubt in pseudo code line 13 Is it K -= 1 or k+=1
@SivaKona-lr9hb14 күн бұрын
bro please do 3 videos per week ❤
@user-pw3wh1tn2s15 күн бұрын
2 pointer sort code bro&explain is good
@YamunaAngadi15 күн бұрын
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
@user-qy4zt5jb7o12 күн бұрын
wrong spelling.. HashSet<Character> set = new HashSet<>();
@Leenaprasanthi16 күн бұрын
Scholarship
@Asusrog-u9e16 күн бұрын
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
@Asusrog-u9e16 күн бұрын
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
@KrishnasaiVikas17 күн бұрын
Anna explanation neat,clarity ga undi. Elantivi Inka pettu Anna
@Bobby-j3n17 күн бұрын
love u bro .... telugu community ki DSA kastalu teerinatte mee chaneel tho....... plz don't stop until this is enough to reach DSA advance
@balu994918 күн бұрын
Super bro
@gpraneeth769318 күн бұрын
Adhaina chesina problem ekuva days gurtu vundali ante ela Tips evu anna plz
@informationhub719916 күн бұрын
oko prblm ni 3 different testcases tho dry run cheyandi...
@sanamunikumar151218 күн бұрын
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
@YamunaAngadi19 күн бұрын
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
@hiteshkumarreddy590119 күн бұрын
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?
@meghanareddy420920 күн бұрын
bro...........binary search video cheyandhi
@YamunaAngadi20 күн бұрын
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
@bharathh_chandraa19 күн бұрын
Done!
@hiteshkumarreddy590120 күн бұрын
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)
@VendiChitralu21 күн бұрын
Bro expalination peaks but code tho step by step explain cheyy 🙏
@shaikhanuman801221 күн бұрын
Bharat, love babbar 450 questions kuda solve cheyava, this would be great help for future generations.
@shaikhanuman801221 күн бұрын
Well explained on two sum problem statement, tq Bharat
@programming818722 күн бұрын
Hi Bharath Chandra, 2 unavailable videos hidden.
@bharathh_chandraa19 күн бұрын
Thanks for pointing out!
@jahnavikanubaddi841822 күн бұрын
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
@Rishi-o8r22 күн бұрын
superb explanation anna👍
@moulishankarmatha14122 күн бұрын
Next videos fast ga pettu bro
@bharathh_chandraa21 күн бұрын
Repu okati release chestunna Mouli!
@pavan6200123 күн бұрын
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 ; } }
@Factstelugu523 күн бұрын
Linked list explain plz😢
@Rishi-o8r23 күн бұрын
very good way of explanation thank you bro .
@Asusrog-u9e23 күн бұрын
#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
@Asusrog-u9e23 күн бұрын
#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)
@user-dn7gj3lk6t24 күн бұрын
int mini=INT_MAX; for(int i=0;i<n;i++) { ans=max(ans,arr[i]-mini); mini=min(arr[i],mini); } return ans;
@Yogeeswar_Thumati24 күн бұрын
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 😅
@SandeepKumar-ix1cv24 күн бұрын
Hi Anna iam Java developer looking for freelancing jobs as Java developer could you please share info
@SandeepKumar-ix1cv24 күн бұрын
Hi Anna o(n3 ) undi kada 9:13 could you please explain in detail
@gangireddymallikarjunaredd436124 күн бұрын
Hi Anna, Meeku telisina Python dsa youtube channel suggest cheyara
@balu_beats__24 күн бұрын
Neet code bruh... Utube lo search chei
@Asusrog-u9e24 күн бұрын
bro last approach ardam kaaledu bro🙄😥
@bharathh_chandraa24 күн бұрын
Doubts note cheskoni pettukondi. Live pettinappudu ee doubts anni clear chesthaanu. Also series ayyaka chaala mandiki ardham kaani videos unte malli remake cheyadaaniki plan chestha!
@kushwanthkumarvutukuri25 күн бұрын
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...
@bharathh_chandraa24 күн бұрын
Yeah Kushwanth, naa migitha work commitments nunchi free cheskoni ee project meedha time pedtunna mee kosam. Naa best consistency tho videos chestha!! And 3rd year vallaki roadmap already oka short petta ... roadmap to high packages take a look