Is Subsequence - Leetcode 392

Today we will solve the "Is Subsequence" problem from Leetcode. We will walk through two pointers solution and then A Dynamic Programming one to solve this problem.

This question has been asked by Google, Meta, Amazon, Apple, Microsoft, and so many other companies.

Please check the channel page for more leetcode solution videos. Also don't forget to like, comment, and subscribe.
Hope you enjoy the video and Thanks for watching 🙏

Chapters:
0:00 Intro
0:04 Examples
0:30 Two pointers solution
1:17 Two pointers Code walk-through
2:20 DP (Tabulation)
4:25 Tabulation Code walk-through
6:34 Time and Space Complexity