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 a subsequence?

    Given a text t and a string s, you are asked to answer one question:
    Is it possible to remove some symbols from t and leave the rest untouched to get the string s? In other words - is s a subsequence of t?

    Input

    The first line of the input contains the text t (1 ≤ |t| ≤ ). The second line contains the string s (1 ≤ |s| ≤ ).

    Output

    The program should print Yes in the case it is possible or No otherwise.

    Examples

    Input
    Output
    hello, world! ello
    Yes
    hello, world! woo
    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