Array Rotation

1 <= N <= 10^5
1 <= A[i] <=10^9
1 <= B <= 10^9

The first argument given is the integer array A.
The second argument given is the integer B.

Return the array A after rotating it B times to the right

Input 1:
A = [1, 2, 3, 4]
B = 2

Input 2:
A = [2, 5, 6]
B = 1

Output 1:
[3, 4, 1, 2]

Output 2:
[6, 2, 5]

Explanation 1:
Rotate towards the right 2 times - [1, 2, 3, 4] => [4, 1, 2, 3] => [3, 4, 1, 2]

Explanation 2:
Rotate towards the right 1 time - [2, 5, 6] => [6, 2, 5]

public class ArrayRotation {
    public static int[] rotateArray(int[] A, int B) {
        int N = A.length;
        int[] result = new int[N];
        
        for (int i = 0; i < N; i++) {
            result[(i + B) % N] = A[i];
        }
        return result;
    }
}

def rotate_array(A, B):
    N = len(A)
    result = [0] * N
    
    for i in range(N):
        result[(i + B) % N] = A[i]
    return result

function rotateArray(A, B) {
    const N = A.length;
    const result = new Array(N).fill(0);
 
    for (let i = 0; i < N; i++) {
        result[(i + B) % N] = A[i];
    }
    return result;
}