Answers for "hackerrank circular array rotation solution"

C++
0

circular array rotation hackerrank solution in javascript

// circular array rotation hackerrank solution in javascript
function circularArrayRotation(a, k, queries) {
  // Write your code here
  for(let i = 0; i < k; i++) {
    a.unshift(a.pop());
  }
  let arr = [];
  for(let j = 0; j < queries.length; j++) {
    arr.push(a[queries[j]]);
  }
  return arr;
}
Posted by: Guest on January-17-2022
-1

arrays left rotation hackerrank solution

int n,d;
    cin>>n;
    int a[n];
    cin>>d;
    for(int i=0;i<n;cin>>a[i],i++);
    d=d%n;
    for(int i=d;i<n;i++)
        cout<<a[i]<<" ";
    
    for(int i=0;i<d;i++)
         cout<<a[i]<<" ";
    return 0;
Posted by: Guest on September-14-2020

Code answers related to "hackerrank circular array rotation solution"

Browse Popular Code Answers by Language