Tuesday, 7 March 2017

Geeksforgeeks Solution For " Immediate Smaller Element "

GeeksforGeeks Solution For School Domain .Below You Can Find The Solution Of Basic ,Easy ,Medium ,Hard .You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Given an integer array, for each element in the array check whether there exist a smaller element on the next immediate position of the array. If it exist print the smaller element. If there is no smaller element on the immediate next to the element then print -1.

Submit Your Solution :- Click Here 

Solution :-

#include <iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
       int n,i;
       cin>>n;
       int ar[n];
       for(i=0;i<n;i++)
       cin>>ar[i];
       //cout<<" ";
       for(i=0;i<n-1;i++)
       {
           if(ar[i]>ar[i+1])
               cout<<ar[i+1]<<" ";
           else
               cout<<"-1 ";
       }
        cout<<"-1\n";
    }
    return 0;
}

Output:-

Geeksforgeeks Solution For " Immediate Smaller Element "

No comments:
Write comments

Recommended Posts × +