Left Rotation

                            Solution in C :

In C:

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {

    int N;
    int d;
    scanf("%d %d", &N, &d);  
    int A[N];
    for (int i = 0; i < N; i++)
    {
        scanf("%d", &A[i]);    
    }
    for (int i = 0; i < N; i++)
    {
        printf("%d ", A[(i + d) % N]);    
    }
    puts("");
    
    return 0;
}







In C++:

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


int main() {
    int N, d, i;
    cin >> N >> d;
    int start = N - d;
    int *arr = new int[N];
    for (i=0; i<N; ++i) {
        if (start == N) start = 0;
        cin >> arr[start++];
    }
    for (i=0; i<N; ++i) cout << arr[i] << " ";
    return 0;
}







In Java:

import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int N = scan.nextInt();
        int n = scan.nextInt();
        int[] A = new int[N];
        for (int i=0; i<N; ++i) {
            A[i] = scan.nextInt();
        }
        for (int i=0; i<n; ++i) {
            rotateArray(A);
        }
        for (int a : A) {
            System.out.print(a+" ");
        }
        System.out.println("");
    }
    
    private static void rotateArray(int[] A) {
        int t = A[0];
        for (int i=0; i<A.length-1; ++i) {
            A[i] = A[i+1];
        }
        A[A.length-1] = t;
    }
}







In Python 3:

n, d = map(int, input().split())
arr = [int(x) for x in input().split()]

for i in range(d):
    arr.append(arr[i])
    
for x in arr[d:]:
    print(x, end=' ')