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

    • Reverse the linked list in chunks

    Given a linked list, you are asked to reverse chunks of length l in the linked list from the very beginning to the very end until there are no chunks left.

    Input

    The initial data for the linked list is obtained automatically. You don’t need to do anything.
    The next line contains a single integer l (1 ≤ l ≤ |L|) the length of the chunks.

    Output

    The program should print the final linked list.

    Examples

    Input
    Output
    10 4 0 -2 3 5 7 -1 8 -9 3 5
    5 3 -2 0 4 3 -9 8 -1 7
    10 4 0 -2 3 5 7 -1 8 -9 3 2
    0 4 3 -2 7 5 8 -1 3 -9
    10 4 0 -2 3 5 7 -1 8 -9 3 1
    4 0 -2 3 5 7 -1 8 -9 3
     

    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