We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
public static List circularArrayRotation(List a, int k, List queries) {
// Write your code here
LinkedList list=new LinkedList<>(a);
ArrayList ans=new ArrayList<>();
if(k>a.size()){
k=k%a.size();
for(int i=1;i<=k;i++){
int n=list.removeLast();
list.addFirst(n);
System.out.println(list);
}
}
else if(a.size()>k){
for(int i=0;i
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Circular Array Rotation
You are viewing a single comment's thread. Return to all comments →
public static List circularArrayRotation(List a, int k, List queries) { // Write your code here LinkedList list=new LinkedList<>(a); ArrayList ans=new ArrayList<>(); if(k>a.size()){ k=k%a.size(); for(int i=1;i<=k;i++){ int n=list.removeLast(); list.addFirst(n); System.out.println(list); } } else if(a.size()>k){ for(int i=0;i