Solving 'Circular Array Rotation' from Hacker Rank ( Easy ) - Problem solving in JS

I'm solving this problem in JS

* It's just a way for me to keep solving questions... *

My Profile :

[liljvnd]

my solution :-

function circularArrayRotation(a, k, queries) {
return queries.map(i => a.at(i-k%a.length ))
}

[fernandosalas]

Here is my solution:

function circularArrayRotation(a, k, queries) {
// n times rotation
let result = a;

for (let i = 0; i < k; i++) {
const lastEle = result[result.length - 1];
result.pop();
result.unshift(lastEle);
}

//final elements container
let final = [];

//show elements at indices
for (let i = queries[0]; i <= queries[queries.length - 1]; i++) {
final.push(result[i]);
}

return final;
}