Click And Win

subodh yadav

C++ Program To Find Duplicate Element In Array Time Complexity O(n),Space Complexity O(1)

QUESTION:  Find Duplicates In O(n) Time And O(1) Extra Space.Given An array Of n Elements With Any Of These Numbers Appearing Any Number Of Times. Find These Repeating Numbers In O(n) And Using Only Constant Memory Space.
For Example
  Let n Be 9 And Array Be {0,2,3,2,3,0,9,9,7}, The OUTPUT Should Be 2, 3 ,9 And 0.

COPY:

#include<iostream>
#include<stdlib.h>
using namespace std;

void repeating_element(int a[],int size)

 {

   int i,count=0;

   cout<<"repeating element = ";

   for(i=0;i<size;i++)

   {

    if(a[abs(a[i])]>0)
    a[abs(a[i])]=-a[abs(a[i])];

else if(a[abs(a[i])]==0)

count++;
else

cout<<" "<<abs(a[i]);  
     }

     if(count>1)

     cout<<" "<<0;
 } 

int main()

{
int a[]={0,2,3,2,3,1,9,9,7};

int n;

n=(sizeof(a)/sizeof(a[0]));

    repeating_element(a,n);

    return 0;

}

OUTPUT :
                

            
www.programmingwithbasics.com
Read More
Ghanendra Yadav

Hacker Rank Solution Program In C++ For " Print Pretty "

PROBLEM :-Your manager gave you a text file with many lines of numbers to format and print. For each row of 3 space-separated doubles, format and print the numbers using the specifications in the Output Format section below.

Input Format

The first line contains an integer, T , the number of test cases.
Each of the T subsequent lines describes a test case as 3 space-separated floating-point numbers: A , B , and , C respectively.

SOLUTION :-Copy The Colored Part And Paste it Into HackerRank Terminal And Click On Submit Button

#include <iostream>
#include <iomanip>
using namespace std;

int main() {
int T; cin >> T;
cout << setiosflags(ios::uppercase);
cout << setw(0xf) << internal;
while(T--) {
double A; cin >> A;
double B; cin >> B;
double C; cin >> C;

/* Enter your code here */   
cout << resetiosflags(ios::uppercase|ios::scientific);
cout << std::setiosflags (ios::left|ios::fixed);
cout << setw(0) << std::hex;
cout << std::setiosflags (ios::showbase);
cout << (unsigned long)A << std::endl;

cout << resetiosflags(ios::showbase);
cout << setw(0xf) << setfill('_')<< std::dec ;
cout << setiosflags (ios::showpos) << setprecision(2);
cout  << B << endl;

cout << resetiosflags(ios::fixed|ios::showpos);
cout << setiosflags (ios::scientific | ios::uppercase) << setprecision(9);
cout << C << std::endl;

/*code ends here*/

}
return 0;


}


OUTPUT:-

1.Compilation With Custom Input

 Hacker Rank Solution Program In C++ For " Print Pretty "

2.All Testcase's 

 Hacker Rank Solution Program In C++ For " Print Pretty "

Read More
Ghanendra Yadav

Hacker Rank Solution Program In C++ For " Maps-STL "

Maps are a part of the C++ STL ( Standard Template Library ). Maps are associative containers that store elements formed by a combination of a key value and a mapped value, following a specific order.The mainly used member functions of maps are:

Map Template:

std::map <key_type, data_type>

Declaration:

map<string,int>m; //Creates a map m where key_type is of type string and data_type is of type int.

Size:

int length=m.size(); //Gives the size of the map.

Insert:

m.insert(make_pair("hello",9)); //Here the pair is inserted into the map where the key is "hello" and the value associated with it is 9.

Erasing an element:

m.erase(val); //Erases the pair from the map where the key_type is val.

Finding an element:

map<string,int>::iterator itr=m.find(val); //Gives the iterator to the element val if it is found otherwise returns m.end() .
Ex: map<string,int>::iterator itr=m.find("Maps"); //If Maps is not present as the key value then itr==m.end().

Accessing the value stored in the key:

To get the value stored of the key "MAPS" we can do m["MAPS"] or we can get the iterator using the find function and then by itr->second we can access the value.

Go To Question On Hacker Rank Click Here

Solution :-

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <set>
#include <map>
#include <algorithm>
using namespace std;


int main() {
    /* Solution By Ghanendra Yadav*/
    map<string,int>s;
    int q;
    cin>>q;
        for(int i=0;i<q;i++)
        {
           int t,n,m;
            cin>>t;
            switch(t)
                {
                case 1:
                {
                    string name;
                    int marks;
                    cin>>name>>marks;
                    map<string,int>::iterator itr=s.find(name);
                    if(itr==s.end())
                    s.insert(make_pair(name,marks));
                    else
                    itr->second+=marks;
                    break;
                }
                case 2:
                {
                    string name;
                    cin>>name;
                    s.erase(name);
                    break;
                }
                case 3:
                {
                    string name;
                    cin>>name;
                    map<string,int>::iterator itr=s.find(name);
                    if(itr==s.end())
                        cout<<"0"<<endl;
                    else
                        cout<<itr->second<<endl;
                    break;
                }
            }
        }
    return 0;

}


OUTPUT :-

1.Compilation With Custom Input

Hacker Rank Solution Program In C++ For " Maps-STL "

2.All Testcase's 

Hacker Rank Solution Program In C++ For " Maps-STL "


Read More