GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers
Problem :- Move all negative elements to end
Submit Your Solution :- Click Here
Solution :-
#include <iostream>
#include <vector>
using namespace std;
int main() {
int t;
cin>>t;
while(t--){
int no,p=0,n=0;
cin>>no;
vector<int> po,ng;
int a[no];
for(int i=0;i<no;i++){
cin>>a[i];
if(a[i]>=0){
p++;
po.push_back(a[i]);
}
else{
n++;
ng.push_back(a[i]);
}
}
for(int i=0;i<p;i++)
a[i]=po[i];
for(int i=0;i<n;i++)
a[p+i]=ng[i];
for(int i=0;i<no;i++)
cout<<a[i]<<" ";
cout<<endl;
}
return 0;
}
Output:-
0 Comments: