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

    • Check if a linked list contains a cycle

    Given a linked list, you are asked to check if it contains a cycle.
    TODO: Should we have a tutorial here?
    TODO: Determine the input format

    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 exceed and the values in the linked list don’t exceed in their absolute value.

    Output

    The program should print Yes in case the linked list contains a cycle and No otherwise.

    Examples

    Input
    Output
    2 3 4 5 3
    Yes
    2 3 4 5 0
    No
    4 3 1 5 2
    Yes
     

    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