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

    • Find the k-th node in a linked list

    Given a linked list, you are asked to answer q queries of the form “What is the k-th value in the linked list?”.

    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 1000 and the values in the linked list do not exceed in their absolute value.
    The first line of the input contains a single integer q (1 ≤ q ≤ 1000).
    The next line contains q space-separated integers (1 ≤ ≤ |L|).

    Output

    The program should print the answers for all q queries separated by a space.

    Examples

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

    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