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.
  1. Arrays: Left Rotation
  2. Discussions

Arrays: Left Rotation

  • Kpsdilshan2
     + 0 comments

    Java 8

    Time complexity - O(n)

    I calculate each item's new index after d rotations and add it to a new list.

    public static List<Integer> rotLeft(List<Integer> a, int d) {
        // Write your code here
        // d<=n
        List<Integer> rusultList = new ArrayList<>();
        
        for(int i=0; i<a.size(); i++) {
            rusultList.add(a.get((i+d) % a.size()));
        }
        return rusultList;
        
    }