Skip to content
Programming101
Programming101

Learn everything about programming

  • Home
  • CS Subjects
    • IoT – Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programming101
Programming101

Learn everything about programming

HackerRank Circular Array Rotation problem solution

YASH PAL, 31 July 2024

In this HackerRank Circular Array Rotation problem For each array, perform a number of right circular rotations and return the values of the elements at the given indices.

HackerRank Circular Array Rotation problem solution

Problem solution in Python programming.

N, K, Q= map(int, input().split())
A= tuple(map(int, input().split()))
for _ in range(Q):
    print(A[(int(input())+N-K)%N])

Problem solution in Java Programming.

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

public class Solution {

    public static void main(String[] args) throws IOException {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(in.readLine());
        int N = Integer.parseInt(st.nextToken());
        int K = Integer.parseInt(st.nextToken());
        int Q = Integer.parseInt(st.nextToken());
        StringTokenizer array = new StringTokenizer(in.readLine());
        ArrayList<Integer> a = new ArrayList<Integer>(N);
        for (int i = 0; i < N; i++) {
            a.add(Integer.parseInt(array.nextToken()));
        }
        List<Integer> subListOne = a.subList(0, (N - (K % N)));
        a.addAll(subListOne);
        
        // Queries
        StringBuilder output = new StringBuilder();
        for (int i = 0; i < Q; i++) {
            int x = Integer.parseInt(in.readLine());
            output.append(a.get(x + (N - (K % N)))).append("n");
        }
        System.out.print(output.toString());
    }
}

Problem solution in C++ programming.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

#define MAX 100010

using namespace std;

int a[MAX];

int main() {
    int n, m, k, x, i;

    while (~scanf("%d %d %d", &n, &k, &m)) {
        k %= n;
        for (i = 0; i < n; ++i) scanf("%d", &a[i]);
        reverse(a, a + n - k);
        reverse(a + n - k, a + n);
        reverse(a, a + n);
        while (m--) {
            scanf("%d", &x);
            printf("%dn", a[x]);
        }
    }

    return 0;
}

Problem solution in C programming.

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

int main() {

    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int32_t N, numOps, queries, temp;
    int32_t i, j;

    scanf("%d", &N) ;
    scanf("%d", &numOps);
    scanf("%d", &queries);

    int32_t array[N], tempArray[N], indexOfAnswers[queries];

    for(i = 0; i < N; ++i)
        scanf("%d", &array[i]);
    for(i = 0; i < queries; ++i)
        scanf("%d", &indexOfAnswers[i]);

    for(i = 0; i < queries; i++)
    {
        printf("%dn",
          array[
                indexOfAnswers[i] >= numOps ?
               ((indexOfAnswers[i] - numOps) - (((indexOfAnswers[i] - numOps)/N) * N)) % N:
        (((indexOfAnswers[i] - numOps) - (((indexOfAnswers[i] - numOps)/N) * N)) + N) % N
              ]);
    }

    return 0;
}

Problem solution in JavaScript programming.

function processData(input) {
    var data = input.split('n');
    var k = parseInt(data[0].split(' ')[1], 10);
    var ns = data[1].split(' ').map(function(s) { return parseInt(s, 10); });
    var qs = data.slice(2).map(function(s) { return parseInt(s, 10); });
    var rotated = [];
    var i, newIndex;

    for (i = 0; i < ns.length; i++) {
        newIndex = (k + i + 1) % ns.length;
        if (newIndex === 0) newIndex = ns.length - 1;
        else newIndex--;
        rotated[newIndex] = ns[i];
    }
    for (i = 0; i < qs.length; i++) {
        console.log(rotated[qs[i]]);
    }
} 

process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
    _input += input;
});

process.stdin.on("end", function () {
   processData(_input);
});

algorithm coding problems

Post navigation

Previous post
Next post
  • HackerRank Separate the Numbers solution
  • How AI Is Revolutionizing Personalized Learning in Schools
  • GTA 5 is the Game of the Year for 2024 and 2025
  • Hackerrank Day 5 loops 30 days of code solution
  • Hackerrank Day 6 Lets Review 30 days of code solution
How to download udemy paid courses for free

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
©2025 Programming101 | WordPress Theme by SuperbThemes