Видео

we are addicted to ur teaching the way u are explaining ,may be this will help our lives in better manner and that helps us to remove the fear towards the coding and due to the playlist discontinued may be audience will shift to the other youtube channels, please we are connected to ur teaching methodology and we need a quick respond through video

Brother waiting for your videos.. Please upload🥲

Anna memu disappointed... like the comment let lokesh anna know

anna we are eagerly waiting please respond to this and we need to continue the playlist

anna hashmap lo suppose oka key value echa like 123:Hello and enko element like 121:Hello can we store same value as multiple times?

Bro its been more than a month...come back quickly bro

Ee series ayyipoyaka AI meeda koda cheyachu ga.... Meeru chala baga explain chesthunaru. 3rd year ki vachamu still nothing learnt about AI your explanation far different from other channels. And AI gurchi manchi RUclips channel ledhu telugu lo so plsssssssss ❤

anna waiting to listen ur voice and please update the playlist

Him 🗿 His explanation 🗿 His efforts 🗿 Thank you bro❤❤❤

Bro 🧐

anna waiting eagerly for ur videos please give some updates anna

Hey what a coincidence, Livermore map eh ela bro 😅

Bro ala kakunda, nen ah array ni set laga convert chestha. If ( length of that set) < (length of the original array), ithey, return true.

Please continue with videos…They are really helpful❤️

DSA with python... And data analyst

def threeSum(nums): nums.sort() # Sort the array res = [] for i in range(len(nums) - 2): # First pointer 'i' if i > 0 and nums[i] == nums[i - 1]: continue # Skip duplicates for 'i' j = i + 1 # Second pointer 'j' k = len(nums) - 1 # Third pointer 'k' while j < k: s = nums[i] + nums[j] + nums[k] # Sum of the triplet if s == 0: res.append([nums[i], nums[j], nums[k]]) # Skip duplicates for 'j' and 'k' while j < k and nums[j] == nums[j + 1]: j += 1 while j < k and nums[k] == nums[k - 1]: k -= 1 j += 1 k -= 1 elif s < 0: j += 1 # Increase 'j' to make the sum larger else: k -= 1 # Decrease 'k' to make the sum smaller return res # Example usage nums1 = [-1, 0, 1, 2, -1, -4] nums2 = [0, 1, 1] nums3 = [0, 0, 0] print(threeSum(nums1)) # Output: [[-1, -1, 2], [-1, 0, 1]] print(threeSum(nums2)) # Output: [] print(threeSum(nums3)) # Output: [[0, 0, 0]]

brother we need to take range upto n-2 and we are forming triplets then we need to give iterate upto n-2 is it correct or else not

The third option🙂

bro chala baga explain chestunaru kani videos chala late vastunay bro

peddamanasu cheskuni kasta Constraints ela use cheyyalo kuda cheppu bro

bro..waiting for your video bro!!!

Link some leet code practice questions based on prefix sum concept.thank you

You won my sub🎉

good explanation on valid palindrome.

Brooo Waiting for Ur Videos_ Nee videos Chusutuney Naa Leetcode JOURNEY Ni start Chesa_

anna waiting for ur videos please keep atleast one video in this week

Anna next topics

Hi Bharat Garu, I solved the issue using below approach(without duplicate scenario). function longestConsectiveNumber(arr) { arr.sort((a, b) => a - b) let sequenceCount = 0 // # create keys let obj = {} let initialLoop = 0 // Store initial value for(let i = 0; i < arr.length -1; i++) { obj[arr[i]] = 1 } while(initialLoop < arr.length -1) { let intialValue = arr[initialLoop] let loopSequence = 1 while(intialValue != 0) { intialValue++ if(obj[intialValue]) { initialLoop++ loopSequence ++ } else { break } } initialLoop++ sequenceCount = Math.max(sequenceCount, loopSequence) } return sequenceCount } let nums = [ 100, 5, 102, 76, ,3 ,4 ,99 ,2 ,6 ,101 ,103 ,104 ,105 ,1] console.log(longestConsectiveNumber(nums));

Clear Cut Explanation on Prefix Sub Array Sum. Tq Bharath

Good explanation on Top K Frequent Element. I solved this question using below method. function topKFrequentElement(arr, k) { let result = arr.reduce((acc, item) => { if(acc[item]) { acc[item] += 1 } else { acc[item] = 1 } return acc }, {}) let output = [] for (const key in result) { if(result[key] >= 2) { output.push(key) } } return output } let nums = [ 1, 1, 1, 2, 2, 3, ] console.log(topKFrequentElement(nums, 2));

Good Explanation on "Anagram problems". I solved the question with the help of your previous video lecture using javascript. TQ very much Bharath. function groupAnagrams(arr) { let result = arr.reduce((acc, item) => { const sortItem = item.split('').sort().join('') if(acc[sortItem]) { acc[sortItem].push(item) } else { acc[sortItem] = [item] } return acc }, {}) return Object.values(result) }

Anna yenti anna asallu consistency ga cheyandi I am depended on u anna and forgetted to say BELATED HAPPY RAKSHA BANDHAN 😊

anna em aypoyaav ,ela unnav? videos evi?

good explanation on two sum problem. easily understand.

bro conttinue the videos

Project ni free hosting websites lo ela host cheyalo oka video chey bro, Konni companies adugutunai internships ki

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?