Learn STL

Here is the list of links of all STLs in cpp i have explained :

Basics

vector STL 

set STL

map STL

list STL 

forward_list STL

deque STL 

queue STL

stack STL 

pair STL 

array STL

Comments

  1. UnknownAugust 1, 2021 at 7:01 AM

    I can say one thing that "really you made coding simple as your name suggest" hats off!!

    ReplyDelete

Post a Comment

Popular posts from this blog

All about pair STL in c++ for competitive programming( initialization, traversal and methods/functions ) :

pair STL Important Points: It is a simple utility container which consists of a single pair. A pair contains values (t1 and t2) which may be of different types . It provides a way to store two heterogeneous objects as a single unit. Keyword ' first ' is used to refer to the first value (t1) and keyword ' second ' is used to refer to the second value (t2) . A pair can be copied and can be compared with other pairs also. Remember to use the header file #include<utility> before using pair STL.   map and pair: map STL uses pair only to store (key, value) pairs in it.  By default, first value (t1) is the key and the second value (t2) is the value associated with the key.       Different ways to initialize a pair STL   1. declaring a pair and using make_pair( ) to make a pair :        pair < int, string > p ;     p = make_pair ( 10, "gamma" ) ;        2. using first and second keyw...
Read more

HackerEarth's basic programming solutions( Ali and Helping innocent people, Duration, Book of Potion making ) :

Problem 21: Ali and Helping innocent people Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder) #include< bits/stdc++.h > using namespace std ; int main () {      int count ;     string s ;     cin >> s ; if (((( s [ 0 ]- '0' )+( s [ 1 ]- '0' ))% 2 == 0 )&&((( s [ 3 ]- '0' )+( s [ 4 ]- '0' ))% 2 == 0 )&&((( s [ 4 ]- '0' )+ ( s [ 5 ]- '0' ))% 2 == 0 )&&((( s [ 7 ]- '0' )+( s [ 8 ]- '0' ))% 2 == 0 )&&( s [ 2 ]!= 'A' ) &&     ( s [ 2 ]!= 'E' ) && ( s [ 2 ]!= 'I' ) && ( s [ 2 ]!= 'O' ) && ( s [ 2 ]!= 'U' ) && ( s [ 2 ]!= 'Y' ) )      {         cout << "valid" << endl ;      }      else  ...
Read more

Coursera's Algorithmic toolbox assignment solutions( Sum of Two Digits, Maximum Pairwise Product ) :

Problem 1: Sum of Two Digits Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder) #include < bits/stdc++.h > using namespace std ; int main () { int a , b ; cin >> a >> b ; cout << a + b ; } This code is simple. There's no need for any explanation.         Problem 2: Maximum Pairwise Product Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder) #include< bits/stdc++.h > using namespace std ; int main () {      long long n , i ;     cin >> n ;      long long a [ n ];      for ( i = 0 ; i < n ; i ++) { cin >> a [ i ]; } sort ( a , a + n ); cout <<( a [ n - 1 ]* a [ n - 2 ]); } This code is simple. There's no need for any ...
Read more