Is It a Subsequence — Solution & Editorial
Greedy two pointers: walk B once, advancing a pointer in A whenever the characters match; A is a subsequence iff its pointer reaches the end.
Complexity: O(|B|)
Greedy two pointers: walk B once, advancing a pointer in A whenever the characters match; A is a subsequence iff its pointer reaches the end.
Complexity: O(|B|)