Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation
      • 19
        BFS

    • Shift the linked list

    Given a linked list, you are asked to shift it by k positions in the right direction.

    Input

    The initial data for the linked list is obtained automatically. You don’t need to do anything. It’s guaranteed that the size of the linked list does not exceed and the values in the linked list don’t exceed in their absolute value. The value of k is always smaller than or equal to the size of the linked list.

    Output

    The data of the linked list is printed automatically. You don’t need to do anything.

    Examples

    Input
    Output
    5 1 4 5 8 0 -1
    -1 4 5 8 0
    5 2 4 5 8 0 -1
    0 -1 4 5 8
     

    Constraints

    Time limit: 1 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

    To check your solution you need to sign in
    Sign in to continue