Tap here to switch tabs
Problem
Submissions

Problem: Is Subsequence

Is Subsequence checks whether one string can be formed from another by deleting characters without changing their order, returning true if the sequence is preserved and false otherwise.

Statement

Given two strings s and t, determine whether s is a subsequence of t. Return TRUE if it is, or FALSE otherwise.

A subsequence of a string is a new string formed by deleting zero or more characters from the original string, without changing the relative order of the remaining characters. For example, "ace" is a subsequence of "abcde", whereas "aec" is not.

Constraints:

  • 0≤0 \leq s.length ≤100\leq 100

  • 0≤0 \leq t.length ≤104\leq 10^4

  • s and t consist only of lowercase English letters.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Is Subsequence

Is Subsequence checks whether one string can be formed from another by deleting characters without changing their order, returning true if the sequence is preserved and false otherwise.

Statement

Given two strings s and t, determine whether s is a subsequence of t. Return TRUE if it is, or FALSE otherwise.

A subsequence of a string is a new string formed by deleting zero or more characters from the original string, without changing the relative order of the remaining characters. For example, "ace" is a subsequence of "abcde", whereas "aec" is not.

Constraints:

  • 0≤0 \leq s.length ≤100\leq 100

  • 0≤0 \leq t.length ≤104\leq 10^4

  • s and t consist only of lowercase English letters.