Rotate Left By 1 Problem

Rotate Left By 1 Problem — ExecCode School DSA Practice

Solve the Rotate Left By 1 problem on ExecCode. Free online school DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

You are given a list of whole numbers. Your task is to move every number one step to the left, and move the first number to the end. Print the new list.

Examples

Input 5 1 2 3 4 5; Output 2 3 4 5 1. Input 2 10 20; Output 20 10

Constraints

1 <= N <= 1000 -10^6 <= Array[i] <= 10^6

Practice Rotate Left By 1 free on ExecCode. Browse DSA problems, topic map, and placement guides.