Видео

Hlo bro

Excellent brother! Late ga vachindi Feeds lo ki! Mi efforts Mi Hardwork 👌💯. keep Going Champ!

hi Should not i use str[left] Instead of str.chartAt(left) ?

Amazing :-) please keep going

which clg bro?

Linear search returns the value or index

Miru coding.... Very easy gaa chestunnaru bro..... Java.. tutorial chestam maalanti variki use avuthundhi bro...

We r interested bro...on opps

Anna maximum interview ki kavalisina important topics anni cheppu anna

If I miss anything, I will add in part 2 Don't worry😊 Please like share Subscribe 😊

#2nd approach code in python arr1 = [1, 2, 4, 5] arr2 = [0, 3, 7, 8, 9] # Swap elements to balance the two arrays i = len(arr1) - 1 j = 0 while i >= 0 and j < len(arr2): if arr1[i] > arr2[j]: arr1[i], arr2[j] = arr2[j], arr1[i] i -= 1 j += 1 else: break # Sort both arrays arr1.sort() arr2.sort() # Concatenate the sorted arrays result = arr1 + arr2 print(result) # Output: [0, 1, 2, 3, 4, 5, 7, 8, 9]

#1st approach code in python: arr1 = [1, 2, 4, 5] arr2 = [0, 3, 7, 8, 9] ans = [] # Initialize an empty list to store the result i, j = 0, 0 # Merge the two arrays while i < len(arr1) and j < len(arr2): if arr1[i] < arr2[j]: ans.append(arr1[i]) i += 1 else: ans.append(arr2[j]) j += 1 # Append remaining elements of arr1, if any while i < len(arr1): ans.append(arr1[i]) i += 1 # Append remaining elements of arr2, if any while j < len(arr2): ans.append(arr2[j]) j += 1 print(ans)

playlist create cheyu bro classes ani

DSA with python beginners to pro level course chy broo

Super

Bro dp topic nkaa problems chepandi

Nee videos super bro but maku basics kavala kadha

Basics nunchii

Bro nuvvu dsa nerchukivadaniki aa channel prefer chasavu

After 2 we get 2^3 vastundhi kadha bro

Please tell data structure from basics

Bro please continue this video's

❤

Congratulations bro.....🎉🎉🎉🎉🎉🎉 thank you so much for teaching... other I know bro but ur videos are more helpful to me..... Like this u go a head u will definitely achieve ur goal.. thank you bro...

Thank you Anna

Tq Anna

ilanti DSA based topics ni telugu lo explain chesevaaru chala takkuva bro. Don't worry ,Future lo ni channel growth ekkadiko velthundi. Just upload your content consistently. kuncham last lo code raasi kuda pai-paina explain chey bro

###APPROACH 2: DUTCH NATIONAL FLAG ALGORITHM def sort_012(arr): low = 0 mid = 0 high = len(arr) - 1 while mid <= high: if arr[mid] == 0: arr[low], arr[mid] = arr[mid], arr[low] low += 1 mid += 1 elif arr[mid] == 1: mid += 1 else: # arr[mid] == 2 arr[high], arr[mid] = arr[mid], arr[high] high -= 1 return arr

###APPROACH 1: def sort_012(arr): count_0 = 0 count_1 = 0 count_2 = 0 # Count occurrences of 0s, 1s, and 2s for num in arr: if num == 0: count_0 += 1 elif num == 1: count_1 += 1 elif num == 2: count_2 += 1 # Reconstruct the array index = 0 # Place all 0s in the array for _ in range(count_0): arr[index] = 0 index += 1 # Place all 1s in the array for _ in range(count_1): arr[index] = 1 index += 1 # Place all 2s in the array for _ in range(count_2): arr[index] = 2 index += 1 return arr

Time and space complexity ki best resource recommend chey bro

❤

Better solve company asked questions in interview then leetcode

Super Brother. Meeru videos Post chestune Undandi.

ni linked in pettu anna

🔥

Bro sort chasi negative index vadi chayachu ga

Miru cheppetappudo.... Little bit confusing avuthundhi bro... Voice back ravatam valla...adhokkati correct cheyyandi bro Thank for teaching ❤bro...

Bro....miii explanation is too good bro but.... Voice back vastundhi

Bro you have amazing talent , thank you so much bro, meeru recent ga cheppina tcs interview question vinna next day naku tcs interview lo adhe question adigaru meeru cheppina logic cheppa,today offer letter vachindhi bro ,naku digital role vachindi bro i hope got placed because of you bro tq again,keep doing more interview questions and help us

Good work🎉

Super bro

Great work,nice explanation bro.keep doing bro.

Bro keep it up bro By the way ur working bro already

¯\_(ツ)_/¯

Your Explanation skills are superb brother 👍👍

Explain whole java with DSA ..if possible in future..it might helpful for so many people 🤝🤝💥

Great explanation brother 🤝❤...ni videos mundey enduku kanapadaledu bro .

Do more shorts don't give up ALL the. Best bro

anna nee explanation chaala bagundi nuvvu views raavatledu ani em baadapadaku trust the process but ur explanation is very excellent please continue this dsa series i am in 3rd year