Left Rotate by d

 1. By d*o(n) time complexity


// Online C++ compiler to run C++ program online

#include <iostream>

#include <climits>

using namespace std;


int remove_duplicate(int* arr, int n){

    int res=0;

    int i=0;

    

    while(i<=n){

        

        if(arr[i]!=0){

            

            arr[res]=arr[i];

            res++;

        }

        i++;

    }

    for(int i=res;i<n;i++){

        arr[i]=0;

    }

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

        cout<<arr[i]<<" ";

    }

    cout<<endl;

    return n;

    

    

}


void left(int*arr,int n){

    int temp=arr[0];

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

        arr[i]=arr[i+1];

    }

    arr[n-1]=temp;

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

        cout<<arr[i]<<" ";

    }

    cout<<endl;

    

}


void left_d(int *arr, int n, int d){

    while (d>1){

        left(arr,n);

        d--;

    }

}


int main() {

    int arr[50]={10,0,20,0,30,0,50};

    int n=7;

    int d=3;

    left_d(arr,n,d);


    return 0;

}


2. By taking o(n) extra space

// Online C++ compiler to run C++ program online

#include <iostream>

#include <climits>

using namespace std;


int remove_duplicate(int* arr, int n){

    int res=0;

    int i=0;

    

    while(i<=n){

        

        if(arr[i]!=0){

            

            arr[res]=arr[i];

            res++;

        }

        i++;

    }

    for(int i=res;i<n;i++){

        arr[i]=0;

    }

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

        cout<<arr[i]<<" ";

    }

    cout<<endl;

    return n;

    

    

}


void left(int*arr,int n){

    int temp=arr[0];

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

        arr[i]=arr[i+1];

    }

    arr[n-1]=temp;

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

        cout<<arr[i]<<" ";

    }

    cout<<endl;

    

}


void left_d(int *arr, int n, int d){

    int arr2[n];

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

        arr2[i]=arr[i];

    }

    for(int i=0;i<d;i++){

        arr[n-d+i]=arr2[i];

    }

    for(int i=d;i<n;i++){

        arr[i-d]=arr2[i];

    }

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

        cout<<arr[i]<<" ";

    }

    cout<<endl;

    

}


int main() {

    int arr[50]={10,0,20,0,30,0,50};

    int n=7;

    int d=3;

    left_d(arr,n,d);


    return 0;

}

3. o(n) time complexity and o(1) space:

3 time rev algo


// Online C++ compiler to run C++ program online

#include <iostream>

#include <climits>

using namespace std;


int remove_duplicate(int* arr, int n){

    int res=0;

    int i=0;

    

    while(i<=n){

        

        if(arr[i]!=0){

            

            arr[res]=arr[i];

            res++;

        }

        i++;

    }

    for(int i=res;i<n;i++){

        arr[i]=0;

    }

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

        cout<<arr[i]<<" ";

    }

    cout<<endl;

    return n;

    

    

}


void left(int*arr,int n){

    int temp=arr[0];

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

        arr[i]=arr[i+1];

    }

    arr[n-1]=temp;

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

        cout<<arr[i]<<" ";

    }

    cout<<endl;

    

}

void rev(int *arr, int l,  int h){

    while(l<h){

        swap(arr[l],arr[h]);

        l++;

        h--;

    }

}

void left_d(int *arr, int n, int d){

    rev(arr,0,d-1);

    rev(arr,d,n-1);

    rev(arr,0,n-1);

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

        cout<<arr[i]<<" ";

    }

    cout<<endl;

    

}




int main() {

    int arr[50]={10,0,20,0,30,0,50};

    int n=7;

    int d=3;

    left_d(arr,n,d);


    return 0;

} 

Comments

Post a Comment

Popular posts from this blog

Sum of Even Numbers till N

Given a number N, print sum of all even numbers from 1 to N. #include<iostream> using namespace std; int main(){        /*  Read input as specified in the question. * Print output as specified in the question. */     int sum,n;     cin>>n;     sum=0;     for (int i=1;i<=n;i++){         if (i%2==0){             sum=sum+i;         }     }     cout<<sum;    } ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// #include<iostream> using namespace std; int main(){        /*  Read input as specified in the question. * Print output as specified in the question. */     int sum,n;     cin>>n;     sum=0;     for (int i=1;i<=n;i++){     ...
Read more

Find the Runner-Up Score!

  Given the participants' score sheet for your University Sports Day, you are required to find the runner-up score. You are given     scores. Store them in a list and find the score of the runner-up. Input Format The first line contains  . The second line contains an array     of   integers each separated by a space. Constraints Output Format Print the runner-up score. Sample Input 0 5 2 3 6 6 5 Sample Output 0 5 Explanation 0 Given list is  . The maximum score is  , second maximum is  . Hence, we print   as the runner-up score. ### OPTIMIZED ### from   collections   import   Counter if  __ name__  ==  '__main__' :      n  =  int ( input ())      arr  =  map ( int ,   input () . split ())           lis = list ( Counter ( arr ) . keys ())      lis . sort ()  ...
Read more

Print All Substrings

  For a given input string(str), write a function to print all the possible substrings. Substring A substring is a contiguous sequence of characters within a string. Example: "cod" is a substring of "coding". Whereas, "cdng" is not as the characters taken are not contiguous Input Format: The first and only line of input contains a string without any leading and trailing spaces. All the characters in the string would be in lower case. Output Format: Print the total number of substrings possible, where every substring is printed on a single line and hence the total number of output lines will be equal to the total number of substrings. Note: The order in which the substrings are printed, does not matter. Constraints: 0 <= N <= 10^6 Where N is the length of the input string. Time Limit: 1 second Sample Input 1: abc Sample Output 1: a ab abc b bc c  Sample Input 2: co Sample Output 2: c co o #include <iostream> #include <cstring> us...
Read more