Is Subsequence

Given two strings s and t, return true if s is a subsequence of t, or false otherwise.

A subsequence of a string is a new string that is formed from the original string by deleting some characters, possibly none, without disturbing the relative positions of the remaining characters. For example, "ace" is a subsequence of "abcde", while "aec" is not.

Follow up: Suppose there are lots of incoming strings s, say s1, s2, ..., sk where k >= 10^9, and you want to check one by one to see if t has its subsequence. In this scenario, how would you change your code?

Example 1
Inputs = "abc", t = "ahbgdc"
Outputtrue
The characters of s appear in t in the same relative order.
Example 2
Inputs = "axc", t = "ahbgdc"
Outputfalse
The character x does not appear in t, so s is not a subsequence.

Constraints

  • 0 <= s.length <= 100
  • 0 <= t.length <= 10^4
  • s and t consist only of lowercase English letters.

Asked at 14 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate