2. Second Largest Element || Arrays Problem Solving

#softwareengineer #coding #datastructuresintelugu #datastructures #algorithm #interview #practiceDSA

[@vinay_sandeep]

Akka ni explanation super chala easy ga ardham avvutundhi ❤

[@balajib2498]

Great explanation sister, beginner point of view nunchi alochinchadam great sister. easy to medium and then hard ane point is very good and will help many beginners. problem explanation ayipoyaka same topic meedha another problem suggest chesi task complete cheyamanadam naku baaga nacchindhi sister. future lo kuda meeru explain chesina tharuvatha related problems task laaga is the chaala help avutadhi sister.

[@Durga_Naveen]

Your Explanation is very good

[@robertpramodh5636]

Thank you for such a great explanation of DSA. Your teaching style is really clear and helpful. For future videos, Could you also include the logic in pseudocode? This might make it easier for viewers from different programming backgrounds to understand the core concept and apply it in their preferred language.

[@godofsyco4615]

I am learning so much from you for free love your content

[@sadhikpathan6091]

Nice explanation..Tqsm...New subscriber added to your family ..🙂.plss continue cheyyandi...Mee channel definite gaa success ithadi 😇

[@harsa208]

Nice akka me explanation chala bagundi..meru dsa Ela neruchukunaruuu....manchi dsa books referen cheyyandi enka manchi Telugu dsa KZbin channel s reffer cheyyandi akkaaa

[@ThabrejShaik]

Thank you for providing such a clear and insightful explanation of DSA! Your teaching style makes complex concepts easy to understand. It would be great if future videos included the logic in pseudocode. This approach could help viewers from different programming backgrounds understand the core ideas more effectively. Pseudocode would also make it easier for learners to implement the concepts in the programming language of their choice. Including this addition could broaden the accessibility and impact of your content.

[@muraliyelliboina4871]

second largest element in an array in a single loop class Solution { public int getSecondLargest(int[] arr) { // Code Here int first=-1,second=-1; if(arr.length==1) { return -1; } for(int i=0;i

[@PavanKumar-kv7ur]

Hi @srinidhi, I have subscribed your channel to learn DSA completely, please post the videos ONE BY ONE on your free time , and i need learn and get the knowledge of problem solving using DSA 😊

[@veerareddy5694]

Akka super akka, continues ga cheye akka super ga unnaye akka videos akka

[@goo-pro5648]

n = len(arr) c = 0 for i in range(n): if arr[i] == arr[n - i -1]: c+=1 if c == n: print('Done')

[@Eswar_12]

Keep continue akka

[@g.upenderreddy]

class Solution { public int getSecondLargest(int[] arr) { // Code Here int largest = -1, secondLargest = -1; for (int i : arr) { if (i > largest) { secondLargest = largest; largest = i; } else if (i < largest && i > secondLargest) { secondLargest = i; } } return secondLargest; } } class Solution { public static boolean isPerfect(int[] arr) { // code here int left = 0, right = arr.length - 1; while (left++ < right--) { if (arr[left] != arr[right]) { return false; } } return true; } }

[@Sharat-bj5hz]

int[] array = { 0, 1, 8, 2, 8, 1, 3 }; int start = 0; int end = array.Length - 1; bool flag = true; while (start < end) { if (array[start] != array[end]) { flag = false; break; } start++; end--; } Console.WriteLine(flag); I have implemented based on your reverse array problem...Thanks

[@Mukeshsainaidu]

Brutefore approach: class Solution: def getSecondLargest(self, arr): # Code Here max = arr[0] for i in arr: if i > max: max = i for i in range(0,len(arr)): if arr[i] == max: arr[i] = 0 m = 0 for i in arr: if i > m: m = i if m !=0: return m return -1

[@ANURADHA-n4z9j]

l=list(map(int,input().split())) g=sorted(set(l)) if (len(g)==1): print(-1) else: print(g[-2])

[@kalyanchandrakongari5856]

n=len(arr) largest_num = -1 second_largest_num = -1 for i in range(n): if arr[i] >largest_num: second_largest_num = largest_num largest_num = arr[i] elif arr[i] < largest_num and arr[i] > second_largest_num: second_largest_num = arr[i] return second_largest_num

[@sukeshsunkari]

public class palindrome { public static void main(String[] args) { int[] arr={5,0,1,1,0,5}; System.out.println("Palindrome check : "+checkpalindrome(arr)); } private static boolean checkpalindrome(int[] arr) { boolean flag=true; int n=arr.length-1; for (int i = 0; i

[@smpgamingfreefire5621]

Face cam unte physical ga class lo kurchoni vintunnattu ga undedhi, ippudu online class la undhi.😢

[@SAIHARSHAP]

ranges::sort(a); A.Unique(erase(A.begin(),A.end()),A.end()) Return a.end()[-2];

[@Programming_life_]

Akka nenu eroju ade video petina youtube lo

[@opgamer6838]

class Solution { isPerfect(arr) { var left = 0; var right = arr.length - 1; while (left < right) { if (arr[left] != arr[right]) { return false; } left++; right--; } return true; } }// javascript

[@MahithaMekala]

public class example { public static void main(String args []){ int arr[]={1,2,5,3,7}; int max=arr[0]; int minvalue=arr[0]; for(int i=1;imax){ minvalue=max; max=arr[i]; } else if(minvalue

[@charuwaka1]

Well Optimized Java Solution public int getSecondLargest(int[] arr) { if (arr.length < 2) return -1; int max = Integer.MIN_VALUE, secondMax = Integer.MIN_VALUE; for (int num : arr) { if (num > max) { secondMax = max; max = num; } else if (num > secondMax && num < max) { secondMax = num; } } return secondMax == Integer.MIN_VALUE ? -1 : secondMax; }

[@harshitayadav1838]

akka from onwards leectcode question link in description

[@pavanspecialvideos..3579]

Akka vaka for loop lo kuda cheyyachu ga..fl lo 0th variable ni initialize cheshi and sl lo -1 ni initialize cheshi manaki fl first dhani kante big ayyithe fl lo I value petti and sl fl value pettuna avvuthundhi ga..akka

[@pavanspecialvideos..3579]

Fl is first largest and sl is second largest

[@Arjun-hc7ow]

arr = [] n = len(arr) left = 0 right = n-1 While left < right: If arr[left] != arr[right]: return False left += 1 right -= 1 return True

[@moranandini278]

Please explain python also

[@praveenk3846]

Akka DSA with python chey❤

[@vamsipreetham6224]

Max1,max2=0,0 If len(arr)==1: Print(-1) For i in range(len(arr)): If max1 < arr[i]: max2= max1 max1 = arr[i] If max1==max2: Print(-1) Print(max2)

[@TechStoriesOfSrinidhi]

This wont work oka case miss aythunav, run chesi chud code

[@vamsipreetham6224]

@@TechStoriesOfSrinidhi max1, max2 = 0, 0 arr = [10, 10, 9] if len(arr) == 1: print(-1) for i in range(len(arr)): if max1 < arr[i]: max1 = arr[i] elif max2 < arr[i] and arr[i] < max1: max2 = arr[i] print(max2) I think this works

[@vamsipreetham6224]

Thank you for your response and support you got great content and will shine as a top youtuber in upcoming days.... in Telugu.

[@dhanushperumalla773]

arr = [10,20,30,40,20] if len(arr) < 2: print("False") else: high = 0 second_highest = 0 for x in range(0,len(arr)): if arr[x] > high: second_highest = high high = arr[x] elif arr[x] > second_highest and arr[x]!= high: second_highest = arr[x] print(high) print(second_highest)

[@a-oneinclined920]

Python lo chppandi bro....ledu ante poll pettandi to continue explaining in which language anii......

[@NakkaChaitra-ie7ip]

mam meru 6:30 o(nlogn) andhe divide chesthe vasthadhi annaru kada mam time complexity cheppina appudu kani ikkada manam ye divide method use cheyaledu kada mam kani yela o(nlogn)vachidhi chepthara please ardham kaledhu mam time complexity

[@TechStoriesOfSrinidhi]

@@NakkaChaitra-ie7ip prathi step lo array ni oka specific size reduce cheste O(logn) aythadi TC ani cheppa yes, ikkada manam brute force approach lo array ni descending order lo sort chestunam, best sorting algorithm TC is O(nlogn) idi ela vachindo manam sorting topic apudu discuss chedam

[@NakkaChaitra-ie7ip]

@@TechStoriesOfSrinidhi ok mam thank u for clarification

[@saikeerthi-c9h]

if (s==s[::-1]): return True else: return False is it correct

[@Mr.venky6539]

Telugu lo DSA enthakanna Baga explain chese vallani chupisthy life time settlements 🤫

[@Arjun-hc7ow]

@@Mr.venky6539 Engineering animuthyam

[@ANURADHA-n4z9j]

l=list(map(int,input().split())) if(l[:] == l[::-1]): print("palimdrome") else: print("not a palindrome")

[@gunasai5572]

def palindrome_not(arr): reverse_array = arr[::-1] if original_array == reverse_array: return True else: return False original_array = [1,2,1] print(palindrome_not(original_array))

[@slimshady-marshal]

Super akka

[@NakkaChaitra-ie7ip]

mam ikkada manam yenduku largest and second largest ni -1 tesukunnamu why not 0 mam both variables intialization

[@TechStoriesOfSrinidhi]

0 ayna teskovachu or INT_MIN ayna teskovachu nen base value like second largest lekapothe -1 return cheyamanad kadaa so -1 teskunaa

[@NakkaChaitra-ie7ip]

@@TechStoriesOfSrinidhi ok mam

[@botlayogi7213]

public static boolean isPerfect(int[] arr) { // code here int start = 0; int end = arr.length - 1; for(int i =0; i

[@4A8552]

s=[1,2,1] t=s[::-1] if s==t: print("True") else: print("False") Akka check this code whether it is right or wrong plz reply? Palindrome array code?

[@TechStoriesOfSrinidhi]

Correct ey kani ikkada nuv extra space vadthunav….’t’ lo reversed list store cheskoni compare chestunav which takes O(n) space….nenu space complexity O(1) undali anna….try alochinchu extra space lekunda ela solve cheyochoo

[@4A8552]

@@TechStoriesOfSrinidhi kk akka

[@Hellohgf]

​@@TechStoriesOfSrinidhi extra space ekkada undhi akkkadaaa

[@TechStoriesOfSrinidhi]

Thanu reversed array ‘t’ lo store cheskunad adi extra space eh kadaa

[@Hellohgf]

@@TechStoriesOfSrinidhi s=[1,2,1] If(s==s[::-1]: Print(True) Else: Print(false) Is this correct

[@sridevi844]

public class Main { public static void main(String[] args) { int[] arr={1,2,3,4,3,2,1}; boolean b=true; int i=0,j=arr.length-1; while(i

[@Charan293]

Arr={1,2,1} If(arr=arr[::-1]) Print("it is a palindrome") else Print("it is not a plaindrome") Is this crct or not !!!! Once reply it

[@ravishanker827]

?????????????Time and space complexity ardham kale mundhu video?????????????? Inkoka video cheyachukadha

[@dhanushperumalla773]

arr = [10,20,30,20,10] rev_arry = arr[::-1] if arr == rev_arry: print("Palindrome") else: print("Not a Palindrome")

[@TechStoriesOfSrinidhi]

Extra space use chesaru to store rev_arry. Space complexity O(1) undali

[@botlayogi7213]

// Code Here if(arr.length < 2){ return -1; } int fLargest = Integer.MIN_VALUE; int sLargest = Integer.MIN_VALUE; for(int a : arr){ if(a > fLargest){ sLargest = fLargest; fLargest = a; } else if(a > sLargest && a != fLargest ){ sLargest = a; } } if(sLargest == Integer.MIN_VALUE) return -1; else return sLargest;

[@nazeertheofficial]

arr1 arr2.reverse() return "".join(arr1)=="".join(arr2)