Find Second Largest Element in Array | Remove duplicates from Sorted Array | Arrays Intro Video

[@takeUforward]

Let's march ahead, and create an unmatchable DSA course! ❤ Use the problem links in description.

[@ParasSharma-mf8or]

I will add it, don't worry

[@mityamkumar1158]

Hey striver, Just a small request, If is it possible then try to paste your video Clip in Right hand side in the lectures, as previous lectures. Because it's a habit of long time to see the solution or explains in left hand side. Just a silly request... 😂

[@sahilbhaiya6200]

456 a to z start kar diye h 😊

[@prithammahato1915]

HAVE UNDERSTOOD_COMPLETELY

[@039puneethbatchu2]

Hello sir, You're so much passionate about teaching. Each and every word of your video goes into my mind . Thank you sir.

[@brindhadhinakaran9672]

Thanks

[@RakeshRanjan-o2d]

hello

[@bhaiookabhai]

started today and completed the first video very well explained! thankyou so much! will continue the streak and will update below every video after successfully watching it! edit: whenever someone likes this comment i get reminded!

[@sriemandi3978]

bro where are you ?

[@pratikdongre4376]

bhag gya kya padhai kr

[@sambitpradhan1211]

@bhaiookabhai kaaha tak pahuncahe dsa , mae aj start kar raha hun

[@showdownx8276]

Arre bhai update to do .... gand faat gaya ki placement ho gaya ?

[@manasisingh294]

@@pratikdongre4376 lmao

[@mahmoodakhtar-df1ze]

I was wondering how my friends were studying so well, then I found out they were all studying from here, man.♥ You have the best way of explaining things! You start everything from scratch and then build it up so well. ♥

[@mindpower185]

GOAT respect ++ because no one can explain the TC & SC for begineers in whole youtube i saw all videos. but no one can expalin like you

[@SRIRAMS-he8gd]

kunal kuswaha can

[@carryminatifun....6841]

0:00 Introduction of Course 0:54 Basics of array 6:33 Introduction of Brute, Better and Optimal Approaches 8:50 Largest element in an array 11:39 Pseudo code 12:44 Code-compiler 13:30 Second Largest element in an array 23:48 coding implementation 28:42 Check if the array is sorted 30:00 Pseudo code 30:49 Code-compiler 31:26 Remove duplicates in place from Sorted array 40:40 Pseudo code 42:12 Code-compiler

[@SatwikSharma21bcs080]

✦ Introduction to Arrays in DS Algo course 00:04 ✦ Defining array globally and accessing its elements 02:30 ✦ Optimizing solutions in interviews is crucial 07:11 ✦ Identifying the second largest element in an array using a brute force solution and the optimal solution. 09:21 ✦ To find the second largest element in an array, start from the back and compare elements with the largest. 13:40 ✦ Brute force approach to find second largest element in array 15:53 ✦ Algorithm for finding second largest element in an array 20:17 ✦ Algorithm to find the second largest element in an array 22:24 ✦ Finding the second largest element in an array 26:31 ✦ Check if array is sorted in non-descending order 28:39 ✦ Modify given array to find unique elements 32:36 ✦ Removing duplicates and finding second largest element using sets 34:40 ✦ Finding the second largest element in an array. 38:50 ✦ Two pointer approach for finding second largest element in array Click to expand 41:00

[@shubhrajit2117]

At 34:28 the set can be made simply as set st(arr, arr + n);

[@VinayakMahadev11]

Is there a set in c++? Do I need to include any header file for using it

[@shubhrajit2117]

@VinayakMahadev11 Just use # include You won't need any other header file then.

[@VinayakMahadev11]

@@shubhrajit2117 tysm bro

[@yhbarve]

The 2-pointer method is so efficient compared to brute force...and it's so short as well...loved it! Understood

[@CodewithKing360]

can you tell me in code to find slarge why we write elseif block

[@abhisheksharma9425]

@@CodewithKing360 public static int largest(int num[]) { int max = 0; for (int i = 0; i < num.length; i++) { if (num[i] >= max) { max = num[i]; } } return max; }

[@CodewithKing360]

@@vedikamishra009 thanks brother tab mera dimag chota tha array ke next level ke question solve karne ke bad vah apne aap samaz aa gayatha

[@Dev2.0]

Completed DP series... That's pure Gold.. Now watching this series to revise concepts.... Striver Bhaiya You are my inspiration 🥺🥺

[@AppaniMadhavi]

Is that Dp series helpful to clear google dsa rounds??

[@saswatrath4646]

yes, super helpful uske sath agar love babbar and interviewbit ka addditional questions laga dega to interview bhi clear ho jayega @@AppaniMadhavi

[@AppaniMadhavi]

Tq for giving clarity@@saswatrath4646

[@aditiapar9355]

@@saswatrath4646 bs dp mei ya har topic mei in dono k additional question lgao?

[@the-shivanshmittal]

So i am a total fan of Kunal Kushwaha for DSA, and this was the first video I saw after many friends said to give a try. I must say for problems oriented DSA, this is good. Now, I can keep a balance between theory clearance and questions practice. Kudos to both mentors.

[@amansayer4943]

KUNAL IS W in theory

[@jaykaantshikre751]

Understood , Never thought easy problems could be solved with such optimal solutions.

[@Manishgupta200]

Superb Striver. The Removed duplicates was much thinkable but solved finally. Thankyou for such an amazin tutorial

[@chintamanipala]

I loved your teaching style as well as how we can build our logic from a brute force approch to optimal approch ❤❤❤

[@siddhant2943]

Thank you for this fantastic and well-structured course Striver. I just started into the world of problem-solving and found it very difficult to follow along on tutorials. But after I started watching your videos my mind began to think of an approach before looking for solutions. Though I still find it challenging to write all the code by myself, I am happy that I have started making progress on the problem-solving part. Things are making sense and I am able to come up with different scenarios before actually solving the problem.

[@anuragsingh-c1x]

bro i am starting dsa. how is strivers for that? also apne kitna kaar liya hai

[@yourcaremail]

@@anuragsingh-c1x striver is amazing, just that you have to practice a lot of questions. just watching striver videos alone will help a little, main thing is rigorous practice.

[@anishaa3298]

there was once in an interview, I was able to sort numbers from two sets of arrays, but I couldn't find second largest element. What you said in 13:38 is so true. Now I will never forget that question.

[@thefourhourtalk]

this course your explanation is just wow ; I am regretting that this piece of gold Ive found a bit late

[@AbhishekSingh-mh2fg]

Watching this video after solving these problems. For the Remove duplicates, i did it like if array[i] < array[i++] if yes then increase the count. I really like the way you explain.

[@parthkandwal8343]

You are doing an amazing job Sir by providing such brilliant content. Thank you very much Sir.

[@thor1626]

Thanks for the amazing explanantion, i was stuck on the duplicates question, but you made it very easy, thanks. keep going. //(11/7/23 || 4:38 am)

[@webtestingui7187]

I am on the who found this channel very late but der aaye durust aaye.These topics are crystal clear in my mind after watching this video Thanks for your effort

[@abhijeetmishra3804]

The video was awesome and so were you with your method of teaching. Hoping that it goes ahead in same way. Thank you, keep growing and keep posting.

[@pranshuatrey]

My damm god, how on earth anyone can teach so brilliantly. Sir u are such a gem.. 💎💎💎💎

[@meegha2697]

Yeah 🙌

[@The_yellow_flash-07]

It has been fantastic! Even as a beginner, I'm able to understand complex problems thanks to your clear explanations. Thank you for making such high-quality content!

[@pratikkumar20]

Just completed. It was amazing, the way you explain, hats off to you Thank you.

[@VishnuKumar-vi8hh]

It was great learning Thanks❤ Bhaiya I have now more interested in coding after seeing your playlist , always feels motivated.

[@AkshayP-x2t]

Great explanation, no rocket science and maths, Thank you for such great content.

[@vikhashjp]

Sir you're a Legend and I have a new interest in Coding after watching your videos and practicing constantly. Thank You ❤

[@ayushi4411]

Sir plz upload the videos as soon as possible coz we have to wait for a single video for about two weeks 🥹🥲

[@takeUforward]

Yes we are going every alternate day now!

[@ayushi4411]

@@takeUforward thanks sir!!!

[@prajwalpatil9055]

Yes sir ur videos are best for revising dsa

[@Lucifer-xt7un]

​@@takeUforward sir please upload videos alternatively as promised becoz relaying on you completely🥺🥲

[@BhanuPratapSinghRajawat-iz2tf]

@@Lucifer-xt7un BRO HE IS PROVIDING THE BEST FREE CONTENT OF DSA AND ALSO HE IS A SOFTWARE ENGINEER AT GOOGLE SO HE HAVE TO DO HIS WORK TOO SO PLZ TRY TO UNDERSTAND HOW MUCH BUSY HE IS BUT STILL HE IS PROVIDING THE BEST CONTENT TO US

[@vidushibhardwaj1415]

this is the first time i'm studying from this channel and you're the best. I'm literally enjoying solving questions today, thankyou so much for this❤

[@Me_Meraj]

Best DSA series i ever watch Really it is better than paid course

[@Prasadk2003]

Today I began the journey of solving problems of DSA , Thank you striver for this great series

[@ParasSharma-mf8or]

0:39 Introduction of course 0:54 Basics of array 6:33 Introduction of brute, better and optimal approaches 8:50 Largest element in an array 11:39 Pseudo code 12:44 code in c++ 13:30 Second Largest element in an array 23:48 coding implementation 28:42 Check if the array is sorted 30:00 Pseudo code 30:49 coding implementation 31:26 Remove duplicates in place from sorted array 40:40 Pseudo code 42:12 coding implementation Time complexity is O(n) and space complexity is O(1) for all optimal approaches

[@takeUforward]

Thank you!!

[@Unknown-ng8me]

@@takeUforward Please make video on OOPs concepts.

[@umakantbhosale4718]

​@@takeUforwardJava collection tab is empty in your course. Please add good resource to learn for it.

[@ANUJKUMAR-wc9dz]

@@umakantbhosale4718 for Java collection you can watch riddi dutta video

[@brajeshmohanty2558]

@@ANUJKUMAR-wc9dz bhai notes nahi milraha hai site pai Kahan pei mil sakta hai notes

[@JhonAbraham-t4c]

love this man the way you explained ,no one explain like you before ,this is the way of teach the code100%.

[@vilen2685]

I'm enjoying now to do DSA !!! Thanks Striver, thanks a lot.

[@Btsarmylachimola]

started today, the video is very well explained. and I will comment on every single video after it is completed.

[@data-ai-yt]

The first 6 minutes are more than sufficient for me to pass the whole semester tbh

[@Simple_learn123]

Actually started enjoying DSA the moment I started watching you! big thanks

[@mehaksharma9391]

we know your schedule is quite busy but still is a requestttt videos jldi upload kro bhaiya placements haiiiiii...and dsa ap hi se pdnaaa hme

[@takeUforward]

Yes we are going every alternate day now!

[@Tussu17]

Ho gaye placement aapki?

[@TunTunTanu]

bhai as striver has not uploaded the string video from where can i watch that videos?

[@sarthakkhandelwal3915]

Best course for dsa 🔥🔥

[@samlinus836]

Such a big thing to share your knowledge in this free platform while there r lots of paid platforms... Thanks a lot Understood bruh

[@JohnCena-uf8sz]

I am watching in sequence, the best explanation frrrr.. SOME ONE REMIND ME TO STUDY BY LIKING THE COMMENT

[@pranavmahendra3423]

Understood bhai Remove duplicates, 2 pointer method and Rest all problems take an element of the array, run the for loop and compare that element to the current value. Thank you Striver Bhai

[@byteeeeeeee]

Hey there!! I'm currently in my sixth semester. I want to revise my DSA for my placements, which start next semester. Just leaving a comment to keep track of my progress.

[@grinding-ffs]

how are ur placements

[@Anurag78183]

Placed ?

[@aayushsingh5614]

This guy will make every BUSINESS TEACHER'S business down for sure.....

[@AmartyaPardeshi]

Great efforts, thanks for this precious course!

[@vishalkumar-ej1oq]

Just watched the first video. It was a great explanation! I'm just pinging here so that I can update my comment after watching each video. 1. Find Second Largest Element in Array | Remove duplicates from Sorted Array | Arrays Intro Video -28-01-2025

[@priyanshi3265]

Thank you striver for the amazing explanation 😊

[@MaheshKumar-jc8sp]

Excellent Mentor till date, great conceptual briefing. Also great tips on preparation as well, Thank you, for this help the underpriviliged like me enormously. If you dont want to spend a lot and still want to Up-skill your career this is the Channel you must refer to.

[@tunapradhan7571]

Bhaiya dsa to Kara rahe ho aaap but sometimes we get frustrated because sometimes after giving sufficient amount of time I can't able to solve a single question also Like in your graph series,you taught absolutely in a excellent way ,but the problems is ki I can't able to solve any of those questions by myself..so can you please upload a session a video in this on KZbin

[@PrithaMajumder]

Raj, Thanks a lot for This Amazing Video about C++ Arrays Video - 1 Completed ✅

[@cinime]

Understood! Super fantastic explanation as always, thank you very much!!

[@jeeveshkumar9682]

understood, and the idea of not making very long videos is superb. Long videos are scary. thanx for ur efforts

[@ryanmathew6397]

Great!! I tried to make an algorithm using this same methodology to find kth largest element by making and vector of size k. but i came out to be O9n^3) it seems. But really great full for your explanation.

[@rariraj4858]

Understood. Perfect explanation. Easy to follow.Thanks so much Striver 😇

[@codeedict3919]

Understood...🔥🚀🔥 || Loving it so far. Thanks for amazing content.

[@Juhi_Kalra]

Understood (in 2024) 👍Thanks for making this series🙌

[@cheddar4848]

Hello striver. The python code in the remove duplicates article is incorrect, as in python the set does not store the values in an ordered way. So while replacing the items in the original list, the updated list might not be sorted. What we can do to fix this is convert set into a list and sorting it, before iterating through it and updating in the original array. Correct Implementation: def removeDuplicate(arr, n): res = list(set(arr)) res.sort() i=0 for item in res: arr[i] = item i+=1 return len(res)

[@rnjnmhta.catomato]

your explanation feels like pure science! beautiful man

[@vatsalsharma6384]

For the last question of removal of duplicates, for the brute force approach, instead of storing it in the set data structure, if we try to store it in a vector again by just putting a condition at the entry that (enter the vector only if you are different from the previous element). Then time complexity will reduce to O(n), and space complexity will be O(1). Am I right????

[@Rks2302]

for a particular element to put in vector we need to look for all the elements already present in vector.. time complexity would be 0(n^2)

[@an__kit]

@@Rks2302 We don't have to look for every element in vector just put the value in temp variable which you entered last and when find the next different value push it into new vector formed and update the temp variable. I think that will work.

[@Rks2302]

@@an__kit suppose already my vector has {1,2,3} elements and by your logic temp=3 and suppose the next element to be inserted is 1 again and since temp is different from 1 another 1 would be inserted isnt it!?

[@an__kit]

@@Rks2302 No we will check for greater element to insert as given array is sorted.

[@Rks2302]

@@an__kit my bad..yes ur correct didnt noticed the array is sorted🥲

[@inspirationalyouthicons4998]

bhaiya you are just awesome! you are an insipiration for the whole student community! big shoutout yo you! continue like tha ,you make many student future bright

[@abbas__00]

Sir , please put all videos in one playlist named DSA because that would be easy for us to watch one by one ....... please sir 🥲

[@takeUforward]

It is already there!

[@confused_bandaa]

im in final year and found most suitable video its not time wasting .

[@venugopal_2003]

great! understood very well

[@sujal.t.s8461]

we use this loop to find 2nd largest element int max1=0,max2=0;; for(auto it:arr) { if(it>max1) { max2=max1; max1=it; } } cout

[@KoushikDas2005]

Why max1 and max2 are initialised to 0 , if it's not existing in the array or even if it's existing in the array, it will result in an error only. Rather it should be max = arr[0] , max2= Integer.MIN_VALUE or you can take both as any arbitrary small value just like I have done in Java. But taking 0 and checking it will give you wrong results

[@Codewithdtuguy]

bhaiya in second largest element question , how can u return an integer value when the function return a vector ?

[@takeUforward]

Follow it properly the code

[@JunaidAnsari-my2cx]

I think the function took a vector as input, and we were to return an integer value

[@senseiAree]

int secondLargest(...) It is returning integer by definition... Hope your doubt was resolved 5 months ago

[@MaheshKumar-jc8sp]

Excellent Mento till date, great conceptual briefing.

[@Josuke217]

Started this playlist: 13/7/2024

[@vikramkumarsoni5283]

U did any other playlist before?

[@AmandeepSingh-rd6ql]

Finished on same date bro best of luck for your journey

[@gladiator8316]

​@@AmandeepSingh-rd6qlBro what's your opinion on this course

[@pallikantisanthoshkumar2671]

How much did your improve​@@AmandeepSingh-rd6ql

[@TunTunTanu]

@@AmandeepSingh-rd6ql bhai as striver has not uploaded the string video from where can i watch that videos?

[@Omkar-fg4ws]

thank you so much bhiya , for providing dsa sheet and explaing the problems.

[@senseiAree]

I am a pretty fast thinker so I was not having much problem but my anxious brain asked me how on earth is he writing those code so freaking fast... I realised I was listening to 1.5x speed.

[@sudeepgupta57]

What is your code forces rating

[@nikhilkashyap3537]

2nd questions answer: vector getSecondOrderElements(int n, vector a) { int max = *max_element(a.begin(), a.end()); int min = *min_element(a.begin(), a.end()); int big = 0, small = max; for (int i = 0; i < n; i++) { if (a[i] > big && a[i] != max) big = a[i]; if (a[i] < small && a[i] != min) small = a[i]; } return {big, small}; } with time complexity: O(n) and space complexity: O(1).

[@Anurag_Singh_98]

9 Nov 2024 completed ☑

[@madhukiran8093]

Helpful in getting back on track after a long Break

[@avipatel7106]

Understood striver! Very good explaination. Thank you for such videos. We appreciate your efforts. Thanks again! ☺

[@gulshankumar9896]

Mindblowing video on arrays in c++ ; thanks striver bhaiya for providing all these awesome materials at free of cost ; 😇

[@muralidharreddy8981]

In java if check the array is sorted: public class Solution { public static int isSorted(int n, int []a) { // Write your code here. for(int i=0;ia[i+1]){ return 0; } } return 1; } }

[@druvabhagavatula]

Understood Bhaiya but I had a small doubt in Sorted and rotated problem only all are super cool 🔥🔥🔥🔥

[@shokir_a_pardaev]

Your teaching style is awesome with passion and energy. What program do you use to write and teach? it looks cool. It would be great if you can also make short video on how you teach and record your classes. Thank you.

[@Deepak-hv8uh]

bhai ne kya gajab samjhaya hai, maza aa gaya

[@chaitu11]

Awesome teaching just fall in love with coding

[@MaheshKumarS-mt6ot]

thank you brother for this kinda of efforts !!! definitely it will help me a lot to get placed in reputed company🤗🤩

[@CodewithKing360]

Bhaiya your approach towards the remove duplicates is very good 😉

[@VikashKumar-tg3ot]

I UNDERSTOOD EVERYTHING .

[@letsdecodewithharsh]

You are great man in explaining the concept too much easy way ♥

[@AtulRawat-sf2lw]

bro college join krne wala hoon pls thoda sa guide kr dijiye

[@rammohan7480]

The way you are explanation is very understandable bro thank you

[@MansiAggarwal-m4f]

maza hi aa gya , understood very well . Thanku so much sir

[@mindiscurious9870]

Best explanation. Still in 11 but understood clearly.

[@kavyanshsrivastava4211]

Left rotation of array by one position can be simply done by: - arr.push_back(arr[0]); arr.erase(arr.begin()); return arr; No traversal needed. Hence reduces time complexity.

[@Anmol-dz7sx]

In the last question while applying the brute force approach by using set data structure the overall time complexity mentioned is O(n*log(n))+O(n), whereas the actual time complexity to insert elements in a set data structure is O(log(n)) + The time complexity to iterate over the set elements using the for loop is O(n). So The Overall time complexity will be O(log(n)) + O(n). Please Correct Me If I'm Wrong!

[@dhanushm9166]

For inserting a single element the time complexity is O(log n) here we need to insert all the elements in the array suppose in worst case we may have n elements so the time complexity for inserting n elements O(nlogn) after that he puts the unique elements back to starting position of the array so for that tc is O(n) and now the overall tc is 0(nlogn +n) ....

[@impalash_ag]

Hi Raj, Just a reminder, HashSet in JAVA doesn't contain elements in any order, hence to maintain the sorted order TreeSet needs to be used.

[@RailExpressbyPreetam]

The way you explained largest element ❤❤

[@secretdreams201]

Thankyou for giving this well structured course.

[@mayankukarde9288]

For question - Check if array is sorted or not Alternative way which we can write instead of writing blank IF body boolean isSorted = true; for(int i=1; i< n ; i ++){ if(a[i] < a[i-1]){ isSorted = false; break; } } System.out.print(isSorted);

[@balakrishna6240]

I love the way you are teaching, awesome

[@priyanshu4016]

great videos , learning a lot from you videos , thanks for creating such great video series .

[@sahilbirnale3949]

Brute , Better , Optimal . You are best 💻

[@AnkitPatel04]

This content for foreign people who have good English accent 😅 , video really fast for me and not unstable for me, 😊

[@shameemahamad2617]

Big thumb 👍 for providing such exceptional remarkable contents.

[@vasukumar9645]

Excellent teaching Everything Understand

[@worthlessguy1621]

Thank you striver for putting so much effort into making these videos. Thank you again :)