Practice Is Subsequence

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#392

LeetCode Problem

Is Subsequence

Two Pointers String Dynamic Programming

Problem Statement

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 (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., "ace" is a subsequence of "abcde" while "aec" is not).

Source: Is Subsequence on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

s = "abc", t = "ahbgdc"

Output

true

# Example 2

Input

s = "axc", t = "ahbgdc"

Output

false

Constraints

0 <= s.length <= 100

0 <= t.length <= 10^4

s and t consist only of lowercase English letters.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free