i am a 2nd year cse student i want to follow your series but i am unable to decide from where i should start. i know c , now i am learing c++. please reply me
Bhaiya, coming from a middle-class family with mediocre teachers, I have always thought I would never get placed due to the fact that I could not afford courses and the difficulty of problem-solving. All of us are blessed to have you as a savior. Thank you very much. I am part of the 2020-2024 batch, and my placements will begin in July. As a result of discovering your channel and starting to prepare, my hopes have been revived. You will make a huge difference in my life if I get a job and can provide for my family.
This is the most complete video on STL no cap , I had seen many STL videos before but this guy covered each and everything in detail and that too in so simple words and ways . Striver u are really the bestt!! Please continue this seriess waiting for your new videos everyday.
I am a first year student in my first Sem, And i am glad that I have found This channel in my early stage of college life. I am going to stick to this Man till my first interview. and also even after that. Thanks for explaining every thing in detail and clearly. I don't see my college professor even near to this guy when it comes to explaining concepts.
@@cr00723 Backend Development with Node and SpringBoot. Basically I am doing an internship so I need to know Spring Boot for that. Also Have a Patent in progress.
This is the most complete video on STL no cap , I had seen many STL videos before but this guy covered each and everything in detail and that too in so simple words and ways .
I have been a software developer for the last 3 years I started preparing for DSA from your channel and I found out your content is one of the best content that is freely available on the internet 💯💯💯💯💯💯
Understood. Today is November 19th, 2024 and i have just completed watching this video. I will come here periodically to update my status and my offers! Wish me luck!
@@AyushKumar-gf5th cut me some slack. Vector does seem to do things that linked list can. After you create a list, you are allowed to add or delete things. C++ can overload the [] operator, so i assumed when you do arr[i], it does traverse until i and get the data for you. But yeah, I'm at fault, considering how everyone interchangeably uses array and vector, i should have guessed vector is prob dynamic array and not linked list. (O(n) time for every time you do arr[i] is painful) My bad
Thanks, Striver. I just completed this STL and in the last section of algorithms, I found the solution to the problems I got struck into while solving 43 questions in Leetcode. Looking forward to complete this amazing playlist..
thankyou so much sir , i completely lost hope when i was coding , but with ur videos i am doing things from scratch again and ur content helps me greatly.
At 24:06 " for(auto it:v) ", don't get confused " it " with iterators. " It " is not an iterator, it represents each element of vector v. We could write it like " for(auto element:v) " and it would run perfectly.
Understand striver after learning stl from this video i am very much confident that if i complete this 350 video a2z course then i can crack any interview. Thanks from Gujarat Surat.
Already watched your previous STL video and this one is awesome 😌(cherry on the top of it :) Best part is how well you've explained comparator implementation👍
Your teaching style is superb. 👌 I've been following your videos since a few weeks and I'm learning dsa on my own pace. Thanks a lot for all your videos. Keep helping juniors. Thanks a lot!
This was my first time learning STL, and bingo ! That was very easy, idk if someone else would have taught like this. Day 5 of Striver A2Z DSA Course Completed ✅
The 'comp' part in sorting ,the __builtin_popcount() ,the next_permuation() and the *max_element() concepts were something I learnt new! Amazing Explanation! Thankyou sir! 🙏
Bhaiya Just a small correction at 45:00 you wrote ms.find(1) + 2 in the end part of the erase() function. But this will give us an error because only array, vector, and string can store elements in contiguous memory locations, so we can't do +2 and access the element after the first occurrence of 1. Here is the corrected code for that part: auto it = ms.find(1); advance(it, 2); /* Now the iterator is one position ahead of where you want it to be. This is because in the erase() function it takes from the start till one element less than the end that we specified.*/ ms.erase(ms.find(1), it); // Now we have the iterator in the correct place so it will erase properly and we will be left with only one 1.
If you reading this then i just want to let you know that you are awesome you are truly truly awesome 😎 , like totally fire it's not about getting placement or high paying it's about enjoying the journey of learning with you and it's truly amazing 🤩. Keep doing dude , you will achieve more 😃.
49:56 There is a syntax error in mpp.emplace({3,1}). Instead of that mpp.emplace(3,1); , you taught it previously in the video. Btw thanks for the most complete and amazing lecture on STL available on youtube Striver !!❤
As u already covered a lot of videos on interview related preparation....i guess now you can upload some CP related stuff like number theory, combinatorics, etc etc... 🤗💕
Thank You Striver ! Wanted to learn STL from a long time but couldn't complete due to the lengthiness of courses available. You gave us the precise idea of stuff that is actually necessary for regular use, Thank YOU !
It's me in January 2024. June or July will be my placement so i started to following ur vedios and road maps. I really having that I will be placed in one of the top company. Thank striver for making us to confident.
At 43:30, you mentioned that all operations on sets take O(log(N)), but on line 383 you've mentioned that erase operation takes O(1) if given an iterator
special case hai i guess. btw at 23:10 vector::iterator it1= v.rbegin(); vector::iterator it2= v.rend(); working?? I GOT THIS ERROR. PLZ HELP BRO error: conversion from 'std::vector::reverse_iterator' {aka 'std::reverse_iterator'} to non-scalar type 'std::vector::iterator' requested pta nhi this doesnt rums😅😅
@@creepopsub2936 iterators are of different type. the rend() member function returns an iterator of type std::vector::reverse_iterator, which gives an error when you try to store in a variable it2 of type std::vector::iterator. Just simply write std::vector::reverse_iterator its2 = v.rend() instead an it will work. As iterators come in varieties (std::vector::cont_iterator to name one), It becomes tedious and an error-prone way to always explicitly define iterator type when declaring a variable. So I'd advice you to use auto keyword instead. It saves you from writing verbose iterator type-names and prevents errors from creeping into your code.
@@aarfeenanees9147 Thank u so much bro! Literally i asked thousands of people about this and no one could teach me this. I didn't even get this on stack overflow etc. Thank u so much buddy! It really meant alot. Are You On LinkedIn??
Hey I am new to this channel so I started exploring but I think the playlist is not arranged well so I've a few doubts has he covered everything in c++ like pointers structure etc or do I need to cover basic c++ before to continue with this playlist?
First learn the basics of c++ then start from striver A2Z dsa sheet not directly youtube videos but start sheet questions of striver 455 questions bcz they all are arranged in well mannered [ east to hard]😊
@@PiyushMishra-tq6cl if u can buy paid udemy course of 500rs. Then u can buy abdul bari c++ course which is very good course on c++ and if u want free course then follow code with harry playlist
Hey Striver, I can solve most of the problems but could not calculate time complexity properly. And also there is no any time and space complexity-related videos in your channel. so can you please make a time and space complexity videos in depth just like recursion ::). Love from Nepal.
He is the best for leaning any language i was facing so many issues earlier but after watching this video i have no doubts about stl at all thank you so much striver
@@pushprajsingh6891 the reason is basic we don't use it cause it's a bad thing bt no in soon videos of Striver he is literally doing this so it dosent really matter
This can be done but iirc this is implementation dependent, this concept is variable length array i think? The c++ standard does not recommended this kind of works because the compiler is fine with array[size] because size is defined at compile time but again you cannot change the size since doing array[size] with a different value of size would count as redefinition of array which would give a compiler error
You're a amazing person because you have a tremendous amount of energy in speaking and thankyou for being a rope for use to climb the mountain of DSA....🙌🙌
awesome content brother! fr! this is that one video that I always wanted where one would explain the basic stl . I always use to get stuck on coding platforms because of that. Now it's sorted.
Really The best Explanation for STL , that too in a shorter period. It Boosts Confidence among students who wants to start DSA in C++ language. Thank You Sir.
Just one imp thing, i lists we cant have random access to memory. list[1] would give error. wherease for vectors we can do it. Note: when operations of insertion/deletion are more prefers lists When operations of accessing elements are more ,prefer vectors.
Mind blowing, participating contests uptill now with basic knowledge, creating functions for already built stl libraries💀, thanks, i hope I'll improve now.👍
day 3 complete thanku pattern vale kl 7 question keye the bs 2 sir ne karaye the bake khud se keye the aaj mane 30 min ke video dekhi h or kl dekhuge 30 min me he bhot jayda knowlege ho gye demag me bhi to rakhna h ache se varna garbage value ho jayege demag me
if someone is landed at this video, please please don't skip, after many try almost DSA, I feel why should learn this series and how important for us, straightforward-> LIFE_TIME, thank you so much strive sir, you are a genius in the world DSA even for indian yes?😉
Thank you so much stiver for this video. I am just starting DSA and it is already getting really hard for me. Don't know how long I'll be able to sustain. Even if I complete all of this, will be worth it at the end or not.
Raj bhaiya, the lecture is golden!!! it was so info. dense . but it is worth it to spend more time understanding each thing. understood it . thank you !
Check Coding Ninjas Out: bit.ly/3GMlV7Z
i am a 2nd year cse student i want to follow your series but i am unable to decide from where i should start. i know c , now i am learing c++. please reply me
@@biswajitadhikary_0807 start coding basic problems in c++
sde sheet not found???
UNDERSTOOD_BHIYA :)
@@kumarisushma4797 🤣🤣
Chapters:
00:01:02 Libraries
00:01:51 namespace std
00:02:40 Functions
00:05:08 STL
00:05:40 pair
00:10:04 vectors ( 1st container )
00:15:25 accessing elements in vector
00:19:28 iterators
00:24:43 deletion in a vector
00:27:00 insertion in a vector
00:29:46 other functions in vector
00:30:26 list ( 2nd container )
00:31:43 Deque ( 3rd container )
00:32:02 Stack (LIFO) ( 4th container )
00:34:16 Time Complexity of stack operations
00:34:27 Queue (FIFO) ( 5th container )
00:35:58 Priority Queue ( 6th container )
00:38:28 Time Complexity of push, pop & top
00:38:50 Set ( 7th container )
00:42:58 Lower bound & Upper bound
00:43:40 Multiset ( 8th container )
00:45:35 Unordered set ( 9th container )
00:47:12 Map ( 10th container )
00:53:22 Multimap ( 11th container )
00:53:46 Unordered map ( 12th container )
00:54:53 Algorithms - Sort
00:59:18 Comp (For sorting)
01:03:26 builtin_popcount( )
01:04:18 next_permutation
01:06:21 max_element
01:06:40 min_element
01:07:09 SUBSCRIBE !!!
Thankyou man!
thanks bhai✌
Thankyou so much!!
@@yagniktalaviya2146 😄😄
@@khushvantkumar1670
Bhaiya, coming from a middle-class family with mediocre teachers, I have always thought I would never get placed due to the fact that I could not afford courses and the difficulty of problem-solving. All of us are blessed to have you as a savior. Thank you very much. I am part of the 2020-2024 batch, and my placements will begin in July. As a result of discovering your channel and starting to prepare, my hopes have been revived. You will make a huge difference in my life if I get a job and can provide for my family.
which clg do you have study ??
You will!!
Good Luck :)
@@aqs.a you also
Bhay hua kya ?
@@arc420 same question
This is the most complete video on STL no cap , I had seen many STL videos before but this guy covered each and everything in detail and that too in so simple words and ways . Striver u are really the bestt!! Please continue this seriess waiting for your new videos everyday.
Are any important topics or use cases missing here? And where can u watch them?
I am a first year student in my first Sem, And i am glad that I have found This channel in my early stage of college life. I am going to stick to this Man till my first interview. and also even after that. Thanks for explaining every thing in detail and clearly. I don't see my college professor even near to this guy when it comes to explaining concepts.
You are very lucky, just keep seeing these videos and practicing!
dont study
kismat wala he bhai tu me to final year me mila ye banda
hey man what are you learning right now?
@@cr00723 Backend Development with Node and SpringBoot. Basically I am doing an internship so I need to know Spring Boot for that. Also Have a Patent in progress.
This is the most complete video on STL no cap , I had seen many STL videos before but this guy covered each and everything in detail and that too in so simple words and ways .
getting this much bulk of knowledge with proper examples in just 1 hr is jst incredible.
Thankyou!
abe mea, rajput k title kyu lgaya h? Allah maaf nhi krega.. 😂
1 hour of a fully packed informationed STL video. Thanks Striver for the level of content you always provide.
I have been a software developer for the last 3 years I started preparing for DSA from your channel and I found out your content is one of the best content that is freely available on the internet 💯💯💯💯💯💯
Gaining such a substantial amount of knowledge with clear examples in just one hour is simply amazing. Thank you!
Understood. Today is November 19th, 2024 and i have just completed watching this video. I will come here periodically to update my status and my offers! Wish me luck!
how's it going ??
Great Video!! Just one correction at 31:19 the underlying data structure of the vector is not a singly linked list its a dynamic array
This needs more upvotes. I've always thought vector is a linked list
@take U forward can u please explain???
@@vigneshwarm really?
@@AyushKumar-gf5th cut me some slack. Vector does seem to do things that linked list can. After you create a list, you are allowed to add or delete things. C++ can overload the [] operator, so i assumed when you do arr[i], it does traverse until i and get the data for you. But yeah, I'm at fault, considering how everyone interchangeably uses array and vector, i should have guessed vector is prob dynamic array and not linked list.
(O(n) time for every time you do arr[i] is painful)
My bad
@@vigneshwarm So what's the correct answer ?
ITs been a long time approx 4 years since I started my career in software development. Started again with dsa to upgrade my self. Thank you Striver.
what is your salary
@@spycake0019 Its better than average.
It's been a great honor while studying on this platform. I have understood all these things. Very thankful for the teachings.
Thanks, Striver. I just completed this STL and in the last section of algorithms, I found the solution to the problems I got struck into while solving 43 questions in Leetcode. Looking forward to complete this amazing playlist..
thankyou so much sir , i completely lost hope when i was coding , but with ur videos i am doing things from scratch again and ur content helps me greatly.
0:00 Basic Structure of C++
5:05 STL components
5:36 Pair: Tuple in C++
7:15 Nested Pair
9:05 Pair Array
10:04 Vectors
16:19 Iterator
30:25 List
31:44 Deque
32:04 Stack
34:29 Queue
36:00 Priority Queue
38:53 Set
43:53 Multiset
45:37 Unordered set
47:12 Map
53:22 Multimap
53:46 Unordered map
54:53 Algorithms
59:17 Comp (For custom sorting inside sort)
01:03:26 __builtin_popcount( )
01:04:18 next_permutation
01:06:21 max_element
01:06:40 min_element
At 24:06 " for(auto it:v) ", don't get confused " it " with iterators. " It " is not an iterator, it represents each element of vector v. We could write it like " for(auto element:v) " and it would run perfectly.
Thanks!!
Thanks was thinking about that only.
what's v represent here { for(auto element : v) }
@@Abhishek-vc5bp V is just a name for the vector(dynamic arrays in c++)
Just a trivia ranged base for loop internally use iterators
This is the best youtube video I've come across. Productive one hour.
Understand striver after learning stl from this video i am very much confident that if i complete this 350 video a2z course then i can crack any interview. Thanks from Gujarat Surat.
Already watched your previous STL video and this one is awesome 😌(cherry on the top of it :) Best part is how well you've explained comparator implementation👍
This is literally the best video for learning C++ STL. Thanks Striver :)
Your teaching style is superb. 👌
I've been following your videos since a few weeks and I'm learning dsa on my own pace. Thanks a lot for all your videos.
Keep helping juniors. Thanks a lot!
this is my first time going through this channel and STL never seemed this easy. Thankyou
I think there just be a small correction at 52:33 , Line No 489 , it should be "cout
just try "cout
Thanks bro
This was my first time learning STL, and bingo ! That was very easy, idk if someone else would have taught like this.
Day 5 of Striver A2Z DSA Course Completed ✅
u r saying that u completed course in 5 days?????
@@OfficialCreater15 no he said that he completed his a2z course 5 days ago
@@moksh_plays5658 (she)said 5 days are completed doing this course
@@moksh_plays5658 you both are wrong 😂, she said, her 5th day of learning dsa is completed.
@@krishnasinghal14 u all are right , she is wrong
Has everything that's required and yet explained in such a clear and structured manner! Amazing video sir 👍👍
Awesome !! Just awesome .. 1 hour video but so packed and curated it took me around 5 hrs to do(i took heavy notes) !!
can you share notes please
@@akhilgupta4997 +1
Yea, i am doing this since afternoon and its 11 at the night. I took long breaks in between though.
Bro I'm facing 404 error while opening the notes uploaded by striver sir ,so can u send me notes
bro can i get your notes
Following the Striver's DSA series, I am pretty sure this video will gonna help a lot in my preparation. Thanks for all your efforts!
The 'comp' part in sorting ,the __builtin_popcount() ,the next_permuation() and the *max_element() concepts were something I learnt new!
Amazing Explanation!
Thankyou sir! 🙏
Even though I've already seen that 45 minutes stl video on TUF and stl series on code-beyond, I'm still going to watch this one. ✌
True same !!
which one should I prefer as a beginner?
@@bhrigumonibaruah251 this one but after then revise for around 3-4 days then it will in heart
@@amitrameshjaisinghaniofficial thanks for your suggestion 🤞
@@amitrameshjaisinghaniofficial but bro the other one on code beyond is of 5hr long is it in much depth explaination?
Bhaiya Just a small correction at 45:00 you wrote ms.find(1) + 2 in the end part of the erase() function. But this will give us an error because only array, vector, and string can store elements in contiguous memory locations, so we can't do +2 and access the element after the first occurrence of 1. Here is the corrected code for that part:
auto it = ms.find(1);
advance(it, 2); /* Now the iterator is one position ahead of where you want it to be. This is because in the erase() function it takes from the start till one element less than the end that we specified.*/
ms.erase(ms.find(1), it); // Now we have the iterator in the correct place so it will erase properly and we will be left with only one 1.
thanks bro
thanks bro
We can do ```ms.erase(ms.find(3), next(ms.find(3), 2));``` also.
@@bihanbanerjee Ya next() and advance() are pretty similar.
@@bihanbanerjee Thank you for showing alternate code
If you reading this then i just want to let you know that you are awesome you are truly truly awesome 😎 , like totally fire it's not about getting placement or high paying it's about enjoying the journey of learning with you and it's truly amazing 🤩. Keep doing dude , you will achieve more 😃.
Heyy,Thats a good message to read
Keep impacting the same...
I like the good vibe going😁💫💫
49:56 There is a syntax error in mpp.emplace({3,1}). Instead of that mpp.emplace(3,1); , you taught it previously in the video. Btw thanks for the most complete and amazing lecture on STL available on youtube Striver !!❤
I have more and more confidence to place a top most company , you are changing my life brighter thank you very much ❤❤❤❤❤👏👏👏
are you placed now?
at 50:00 you dont have to put curly brackets for maps when using emplace function, only for insert function
As u already covered a lot of videos on interview related preparation....i guess now you can upload some CP related stuff like number theory, combinatorics, etc etc... 🤗💕
Do Product Based Comapany also ask CP ? I don't think so.
@@imshivendra I heard few top product based companies prefer CP....
Greatest Stl video one could ever create. Each and every point is covered with great detailing
Thank You Striver !
Wanted to learn STL from a long time but couldn't complete due to the lengthiness of courses available.
You gave us the precise idea of stuff that is actually necessary for regular use, Thank YOU !
Life changing for midddle class students who cannot afford high cost courses...even if they do afford ..here content quality is just Top notch!!! 💯💯
This is indeed a complete STL package. Thanks a lot❤
This is a great summarized STL video, really helpful for beginners as well as advanced folks (it's like a mini revision for y'all)
Who asked?
at 57:13 descending sort syntax should be "sort(a,a+n,greater());"
The session was fairly informative and helpful!!.Looking forward to attending more such sessions.
Honestly this is the best video on STL, please keep up the good work. KUDOS.
Today I just learnt the STL part of C++. Thanks Raj dada!! 💌
Thank you Striver, you’re one of the best teachers I ever had.
Thank you for explaining in such easy and concise way! 🙏
It's me in January 2024.
June or July will be my placement so i started to following ur vedios and road maps.
I really having that I will be placed in one of the top company.
Thank striver for making us to confident.
2024*
Us bro us
👍
At 43:30, you mentioned that all operations on sets take O(log(N)), but on line 383 you've mentioned that erase operation takes O(1) if given an iterator
special case hai i guess.
btw at 23:10 vector::iterator it1= v.rbegin();
vector::iterator it2= v.rend();
working??
I GOT THIS ERROR. PLZ HELP BRO
error: conversion from 'std::vector::reverse_iterator' {aka 'std::reverse_iterator'} to non-scalar type 'std::vector::iterator' requested
pta nhi this doesnt rums😅😅
@@creepopsub2936 iterators are of different type. the rend() member function returns an iterator of type std::vector::reverse_iterator, which gives an error when you try to store in a variable it2 of type std::vector::iterator. Just simply write std::vector::reverse_iterator its2 = v.rend() instead an it will work.
As iterators come in varieties (std::vector::cont_iterator to name one), It becomes tedious and an error-prone way to always explicitly define iterator type when declaring a variable. So I'd advice you to use auto keyword instead. It saves you from writing verbose iterator type-names and prevents errors from creeping into your code.
@@aarfeenanees9147 Thank u so much bro! Literally i asked thousands of people about this and no one could teach me this. I didn't even get this on stack overflow etc.
Thank u so much buddy! It really meant alot.
Are You On LinkedIn??
@@aarfeenanees9147 I would surely love to connect with you. Thank you so much yar.
@@creepopsub2936 I'm not on LinkedIn yet, but will create an account once I start College.
Hey I am new to this channel so I started exploring but I think the playlist is not arranged well so I've a few doubts has he covered everything in c++ like pointers structure etc or do I need to cover basic c++ before to continue with this playlist?
First learn the basics of c++ then start from striver A2Z dsa sheet not directly youtube videos but start sheet questions of striver 455 questions bcz they all are arranged in well mannered [ east to hard]😊
@@Vipul_775 Thanks bro but from where should I cover basic c++?
@@PiyushMishra-tq6cl if u can buy paid udemy course of 500rs. Then u can buy abdul bari c++ course which is very good course on c++ and if u want free course then follow code with harry playlist
@@PiyushMishra-tq6cl code with harry
Hey I saw his azsheet but In the heap learning section there was no video
Hey Striver, I can solve most of the problems but could not calculate time complexity properly. And also there is no any time and space complexity-related videos in your channel. so can you please make a time and space complexity videos in depth just like recursion ::). Love from Nepal.
Check uncode gate serious might help
thanks a lot ..really helpful .this 1 hr course of stl was just the best stl video i came across till now 👏👏
He is the best for leaning any language i was facing so many issues earlier but after watching this video i have no doubts about stl at all thank you so much striver
Java Collections please !!
Bhiaya pls make one video about collection framework video for java users
Soon!
@@takeUforward looking forward to it 🔥
00:11:00
can't we resize array like this
int size;
cin>>size;
int array[size];
Yes you can
but its not recommended to do so ...i dont remember the exact reason by now
@@pushprajsingh6891 the reason is basic we don't use it cause it's a bad thing bt no in soon videos of Striver he is literally doing this so it dosent really matter
This can be done but iirc this is implementation dependent, this concept is variable length array i think? The c++ standard does not recommended this kind of works because the compiler is fine with array[size] because size is defined at compile time but again you cannot change the size since doing array[size] with a different value of size would count as redefinition of array which would give a compiler error
One of the rare indian youtuber that is not annoying to listen to. Good video man.
Finally learned stl.
7/7/24.
Thanks a lot. One of the best teacher❤
44:07 the fact he's enjoying by teaching us , ThankYou STRIVER💗
best STL video ever existed on youtube !! . Thank you so much bhaiya.
You're a amazing person because you have a tremendous amount of energy in speaking and thankyou for being a rope for use to climb the mountain of DSA....🙌🙌
A great introductory part for all the beginners. Feeling grateful to have you striver
The best C++ STL video on TH-cam.❤❤
Its an incredibly amazing video to get started. I was trying to do a coursera course which never covered all these in one shot
Best video on STL I have ever found. Thanks a lot. 🙏🏼
Best STL playlist i have ever seen🥺.thanks bro
Short and crisp lecture on STL in C++. It helped me a lot.Thanks for this Video : )
Counting number of bits and permutations in a string is so useful. Thank you so much Sir!!
Thank you, Striver! for explaining the C++ STL in a clear-cut way. It helps me to learn C++ STL quickly.
The way he explains everything is very good.thanks bro for this. This is very helpful for us.
Soo grateful for such videos at free of cost ...
just sharing it with my friends. such an incredible channel .mind blowing content
What a video sir !! Really hats off to your hardwork. The way you teach is simply amazing. Keep going, keep growing.
Thanks Striver i was struggling with STL but This video really helped me a lot.😍
awesome content brother!
fr! this is that one video that I always wanted where one would explain the basic stl . I always use to get stuck on coding platforms because of that. Now it's sorted.
thank you for making this series it really helps
thank you so much striver bhaiya❣❣❣
Really The best Explanation for STL , that too in a shorter period. It Boosts Confidence among students who wants to start DSA in C++ language. Thank You Sir.
Best STL video on youtube !
Great i learnt the STL way better from your video Striver thanks for the video and good luck !
Just one imp thing, i lists we cant have random access to memory. list[1] would give error. wherease for vectors we can do it.
Note: when operations of insertion/deletion are more prefers lists
When operations of accessing elements are more ,prefer vectors.
Mind blowing, participating contests uptill now with basic knowledge, creating functions for already built stl libraries💀, thanks, i hope I'll improve now.👍
day 3 complete
thanku
pattern vale kl 7 question keye the bs 2 sir ne karaye the bake khud se keye the
aaj mane 30 min ke video dekhi h or kl dekhuge 30 min me he bhot jayda knowlege ho gye demag me bhi to rakhna h ache se varna garbage value ho jayege demag me
What a beautiful video it was...Thank u so much for this...
55:61 the functor is missing parentheses, i.e. final code will be:
`sort(a, a+n, greater())`
thanks a lot
Some corrections:
sort(a,a+n,greater()); //sorts in descending order
sort(begin(a),end(a),comp);
if someone is landed at this video, please please don't skip, after many try almost DSA, I feel why should learn this series and how important for us, straightforward-> LIFE_TIME, thank you so much strive sir, you are a genius in the world DSA even for indian yes?😉
Thank you so much stiver for this video. I am just starting DSA and it is already getting really hard for me. Don't know how long I'll be able to sustain. Even if I complete all of this, will be worth it at the end or not.
you are an inspiration striver and a good human being.
Best video ON STL for begineers.
i was suffering from writing big codes your tutorial made me help
Thanks
Raj bhaiya, the lecture is golden!!! it was so info. dense . but it is worth it to spend more time understanding each thing. understood it . thank you !
very short concise and beautifully explained for intermediates and beginners!
The syntax of reverse iterator is wrong. It should be:
vector :: reverse_iterator = v.rbegin();
iterator used with rbegin() will give error.
Raj, Thanks a lot for This Amazing Video about C++ STL
Lecture - 6 Completed ✅
you are making DSA life easier👍
Really good crash course for C++ STL library. Can quickly learn all the available data structures and get Leetcoding.
"The teaching methodology explains the expertise acquired by the instructor, making it the best one-stop solution for learning DSA