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

Practice Link:

You can follow me across social media, all my handles are below:

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

[takeUforward]

Let's march ahead, and create an unmatchable DSA course! ❤

Use the problem links in description.

[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!

[mindpower]

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

[mahmoodakhtar-dfze]

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. ♥

[shubhrajit]

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

[jaykaantshikre]

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

[siddhant]

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.

[chintamanipala]

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

[yhbarve]

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

[abhijeetmishra]

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.

[parthkandwal]

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

[Manishgupta]

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

[Dev.]

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

[AbhishekSingh-mhfg]

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.

[pratikkumar]

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

[VishnuKumar-vihh]

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

[thefourhourtalk]

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

[cinime]

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

[AmartyaPardeshi]

Great efforts, thanks for this precious course!

[thor]

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)