Create a dummy array of the same length as the original array.
Shift all elements in the original array toward the left, copying them into the dummy array.
After shifting, place the value of the 0th index of the original array into the last element of the dummy array.
Finally, print the dummy array which now contains the left-shifted elements with the 0th element moved to the last position.

Code

#include<bits/stdc++.h>
using namespace std;

// Function to solve and shift array elements left by one position
void solve(int arr[], int n) {
    int temp[n];  // Create a temporary array to store the shifted elements

    // Shift the elements to the left by one position
    for (int i = 1; i < n; i++) {
        temp[i - 1] = arr[i];
    }
    temp[n - 1] = arr[0];  // The first element moves to the last position

    // Print the rotated array
    for (int i = 0; i < n; i++) {
        cout << temp[i] << " ";  // Print each element of the rotated array
    }
    cout << endl;
}

int main() {
    int n = 5;  // Size of the array
    int arr[] = {1, 2, 3, 4, 5};  // Original array

    solve(arr, n);  // Call the solve function to rotate and print the result

    return 0;
}
// Class containing the solve method
class Solution {

    // Function to solve and shift array elements left by one position
    public static void solve(int[] arr, int n) {
        int[] temp = new int[n];  // Temporary array to store shifted elements

        // Shift elements to the left by one 