233. Is Subsequence
EasyTwo Pointers
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).
Examples
Input: abc ahbgdc
Output: true
Explanation: a, b, c all appear in 'ahbgdc' in order (a_b__c).
Constraints
- 0 <= s.length <= 100
- 0 <= t.length <= 10^4
- s and t consist only of lowercase English letters.
Loading...
Run checks all cases above. Submit evaluates all test cases.