Leetcode Problem 392. Is Subsequence

392. Is Subsequence

Leetcode Solutions

Initialize two pointers, left for the s string and right for the t string, starting at 0.
While both pointers are within their respective strings: a. If characters at s[left] and t[right] match, increment left. b. Increment right.
If left equals the length of s, return true as all characters in s have been matched in t.
If the end of t is reached (i.e., right equals the length of t), return false as not all characters in s could be matched.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen