Capgemini Coding Q1

Q).

=> Solution :

#include<iostream>

#include<vector>

#include<algorithm>

using namespace std;

vector<int> removeDupMerge(int a1[],int a2[],int m,int n){

vector<int> mVec;

for(int i=0;i<m-1;i++){

if(a1[i]!=a1[i+1])

mVec.push_back(a1[i]);

}

mVec.push_back(a1[m-1]);

for(int i=0;i<n-1;i++){

if(a2[i]!=a2[i+1])

mVec.push_back(a2[i]);

}

mVec.push_back(a2[n-1]);

sort(mVec.begin(),mVec.end());

return mVec;

}

int main(){

int m,n;

vector<int> myVec;

cin>>m;

int a1[m];

for(int i=0;i<m;i++)

cin>>a1[i];

cin>>n;

int a2[n];

for(int i=0;i<n;i++)

cin>>a2[i];

sort(a1,a1+m);

sort(a2,a2+n);

cout<<"\n\n*******| OUTPUT |*******\n\n";

myVec=removeDupMerge(a1,a2,m,n);

//find median

int median,sVec=myVec.size();

if(sVec%2==0){

median=(sVec-1)/2 + sVec/2;

}else{

median=(sVec-1)/2;

}

cout<<myVec[median]<<endl;

}

=>Output :

Comments

Maximum possible number of monsters you can defeat?

Q).Maximum possible number of monsters you can defeat? =>Introduction: While playing an RPG game, you were assigned to complete one of the hardest quests in this game. There are n monsters you'll need to defeat in this quest. Each monster i is described with two integer numbers - poweri and bonusi. To defeat this monster, you'll need at least poweri experience points. If you try fighting this monster without having enough experience points, you lose immediately. You will also gain bonusi experience points if you defeat this monster. You can defeat monsters in any order. The quest turned out to be very hard - you try to defeat the monsters but keep losing repeatedly. Your friend told you that this quest is impossible to complete. Knowing that, you're interested, what is the maximum possible number of monsters you can defeat? (Question difficulty level: Hardest) => Input: The first line contains an integer, n, denoting the number of monsters. The next line contains an...

Android Activity Lifecycle Phases

Q2. Create an application to display various android activity lifecycle phases. Android Program : MainActivity.java package com.kishanhaldar.implicit_intent; package com.example.hp.myhello; import android.content.res.Configuration; import android.support.v7.app.AppCompatActivity; import android.os.Bundle; import android.util.Log; public class MainActivity extends AppCompatActivity { String msg = "Android :"; @Override protected void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); setContentView(R.layout.activity_main); Log.d(msg, "On created Method()"); } protected void onStart() { super.onStart(); ...

Count Frequency of Character in Any Sentence using C++

Q)Write the C++ program for character frequency count for any sentence => Program : #include<iostream> #include<string> #include<iomanip> using namespace std; int main(){ string mystr; cout<<"Enter the Any Sentence for character frequency count \n"; getline(cin,mystr); int charFreq[26]={0}; for(int i=0;i<mystr.length();i++){ int index=mystr[i]-'a'; charFreq[index]++; } cout<<"\n****************************************\n"; cout<<"\nSentence : "<<mystr<<endl<<endl; cout<<setw(12)<<"Character"<<setw(12)<<"Frequency"<<endl<<endl; for(int i=0;i<26;i++){ if(charFreq[i]!=0){ cout<<setw(6)<<char(i+'a')<<setw(10)<<charFreq[i]<<" times \n"; } } } =>Output :

Code In Ur Hand

Search This Blog