This is my solution in Java

public class Solution {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int d = scan.nextInt();
        int[] array = new int[n];
        for(int i=0; i<n;i++) {
            array[(i+n-d)%n] = scan.nextInt();
        }
        for(int i=0; i<n;i++) {
            System.out.print(array[i] + " ");
        }      
    }
}

Simplest one liner in python

for value in (arr[d:] + arr[0:d]): print value,

Hello friends,

Arrays left rotation - In this video, I have explained Arrays left rotation hackerrank solution algorithm. hackerrank Arrays left rotation problem can be solved by using auxilary array.

If interested to know more about the generic algorithm in details-

click here for the video explanation of generic algorithm with complexity analysis.

or you can click on the image too to follow youtube tutorial.

Here is the working solution:-

source code :

static int[] rotLeft(int[] a, int d) {
		int n = a.length;
		int[] rotArray = new int[n];

		for (int oldIndex = 0; oldIndex < n; oldIndex++) {
			int newIndex = (oldIndex + n - d) % n;
			rotArray[newIndex] = a[oldIndex];
		}

		return rotArray;

	}

Would really appreciate your feedback like, dislike , comment etc. on my video.

Do not forget to upvote, if you find it useful.

Neatest code to get this done!!!

int n,d;
    cin>>n;
    int a[n];
    cin>>d;
    for(int i=0;i<n;cin>>a[i],i++);
    d=d%n;
    for(int i=d;i<n;i++)
        cout<<a[i]<<" ";
    
    for(int i=0;i<d;i++)
         cout<<a[i]<<" ";
    return 0;

I don't know where to put my solution...