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

    • Is this linked list a palindrome?

    Given a linked list, you are asked to check if it’s a palindrome. A palindrome is a sequence of items that’s the same if processed from the start and the end (abacaba or abccba).

    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 are all Latin lowercase letters.

    Output

    The program should print Yes if the linked list is a palindrome and No otherwise.

    Examples

    Input
    Output
    abccba
    Yes
    abc
    No
     

    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