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.
My solution i think its easy to use and implement not sure if its efficient though.
public static List<Integer> rotLeft(List<Integer> a, int d) {
// Loop from 0 to Number of rotations
for(int i = 0; i < d ; i++)
{
// Get the value at first index of list to temp variable
int temp = a.get(0);
// remove the first element
a.remove(0);
// add it back to list by default it goes to the end
a.add(temp);
}
return a;
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Arrays: Left Rotation
You are viewing a single comment's thread. Return to all comments →