5455565758

import java.util.*;

class Solution {
    // Function to reverse the array between start and end
    private void reverseArray(int[] nums, int start, int end) {

        while (start < end) {
            int temp = nums[start];
            nums[start] = nums[end];
            nums[end] = temp;
            start++;
            end--;
        }
    }

    // Function to rotate the array to the left by k positions
    public void rotateArray(int[] nums, int k) {
        int n = nums.length; // Size of array
        k = k % n; // To avoid unnecessary rotations
        
        // Reverse the first k elements
        reverseArray(nums, 0, k - 1);

        // Reverse the last n-k elements
        reverseArray(nums, k, n - 1);

        // Reverse the entire array
        reverseArray(nums, 0, n - 1);
    }
}

class Main {
    // Helper function to print the array  
    public static void printArray(int[] nums) {
        for (int val : nums) {
            System.out.print(val + " ");
        }
        System.out.println();
    }
    
    public static void main(String[] args) {
        int[] nums = {1, 2, 3, 4, 5, 6};
        int k = 2;

        System.out.println("Initial array: ");
        printArray(nums);

        // Create an instance of the Solution class
        Solution sol = new Solution();

        /* Function call to rotate the 
        array to the left by k places */
        sol.rotateArray(nums, k);

        System.out.println("Array after rotating elements by " + k + " places: ");
        printArray(nums);
    }
}

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647

class Solution:
    # Function to reverse the array between start and end
    def reverseArray(self, nums, start, end):
        while start < end:
            temp = nums[start]
            nums[start] = nums[end]
            nums[end] = temp
            start += 1
            end -= 1

    # Function to rotate the array to the left by k positions
    def rotateArray(self, nums, k):
        n = len(nums)  # Size of array
        k = k % n  # To avoid unnecessary rotations
        
        # Reverse the first k elements
        self.reverseArray(nums, 0, k - 1)

        # Reverse the last n-k elements
        self.reverseArray(nums, k, n - 1)

        # Reverse the entire array
        self.reverseArray(nums, 0, n - 1)


# Helper function to print the array
def printArray(nums):
    for val in nums:
        print(val, end=" ")
    print()


if __name__ == "__main__":
    nums = [1, 2, 3, 4, 5, 6]
    k = 2

    print("Initial array: ")
    printArray(nums)

    # Create an instance of the Solution class
    sol = Solution()

    # Function call to rotate the array to the left by k places
    sol.rotateArray(nums, k)

    print(f"Array after rotating elements by {k} places: ")
    printArray(nums)

123456789101112131415</