Use of next_permutaion in C++

#include <iostream>
#include <algorithm>
using namespace std;
int main ()
{
    string s = "imtiyaz";

    while(next_permutation(s.begin(),s.end()))
        cout<<s<<endl;

    return 0;
}

Use of 2D Vector in C++

#include <iostream>
#include <vector>
using namespace std;
int main ()
{
    vector<int>v[3];
    int i,j,val;
    for(i=0;i<3;i++)
    {
        for(j=0;j<3;j++)
        {
            cin>>val;
            v[i].push_back(val);
        }
    }
    for(i=0;i<3;i++)
    {
        for(j=0;j<3;j++)
        {
            cout<<v[i][j]<<" ";
        }
        cout<<"\n";
    }
}

Use of Iterator in C++

#include <iostream>
#include <vector>
#include <iterator>
#include <cstdio>
using namespace std;
int main()
{
    vector<int>v;
    vector<int>::iterator j;
    int i,val;
    for(i=0;i<10;i++)
    {
        cin>>val;
        v.push_back(val);
    }
    for(j=v.begin();j<v.end();j++)
    {
        cout<<*j<<endl;
    }
    return 0;
}

Use of Map in C++

#include <iostream>
#include <map>
#include <string>
#include <cstdio>
using namespace std;
int main ()
{
    string str;
    getline(cin,str);
    map<char,int>mp;
    for(int i=0;i<str.length();i++)
        mp[str[i]]++;
    for(int i='a';i<='z';i++)
        if(mp[i]>1)
            printf("%c %d\n",i,mp[i]);
    return 0;
}

Use of Set in C++

#include <iostream>
#include <cstdio>
#include <set>
using namespace std;
int main ()
{
    set<int>s;
    int val,i;
    for(i=0;i<10;i++)
    {
        cin>>val;
        s.insert(val);
    }
    set< int > :: iterator it;
    for(it = s.begin(); it != s.end(); it++)
    {
        cout << *it << endl;
    }
    return 0;
}

Use of Priority Queue

#include <iostream>
#include <queue>
using namespace std;
int main ()
{
    priority_queue <int> pq;
    int i,val;
    for(i=0;i<10;i++)
    {
        cin>>val;
        pq.push(val);
    }
    while(!pq.empty())
    {
        cout<<pq.top()<<endl;
        pq.pop();
    }
    return 0;
}

Use of Queue in C++

#include <iostream>
#include <queue>
using namespace std;
int main ()
{
    queue<int>q;
    int val;
    for(int i=0;i<10;i++)
    {
        cin>>val;
        q.push(val);
    }
    while(!q.empty())
    {
        cout<<q.front()<<endl;
        q.pop();
    }
    return 0;
}

Use of Stack in C++

#include <iostream>
#include <stack>
using namespace std;
int main ()
{
    stack<int>st;
    int val;
    for(int i=0;i<10;i++)
    {
        cin>>val;
        st.push(val);
    }
    while(!st.empty())
    {
        cout<<st.top()<<endl;
        st.pop();
    }
    return 0;
}

Use of Vector in C++

#include <iostream>
#include <vector>
using namespace std;
int main ()
{
    vector<int>t;
    int val,i,n;
    cout<<"Array Elements: ";
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>val;
        t.push_back(val);
    }
    for(i=0;i<10;i++)
        cout<<t[i]<<endl;

    return 0;
}