Given two strings s and t, determine whether s is a subsequence of t. Return TRUE if it is, or FALSE otherwise.

A subsequence of a string is a new string formed by deleting zero or more characters from the original string, without changing the relative order of the remaining characters. For example, "ace" is a subsequence of "abcde", whereas "aec" is not.

Constraints:

• $0 \leq$ s.length $\leq 100$

• $0 \leq$ t.length $\leq 10^4$

• s and t consist only of lowercase English letters.

Now, let's take a moment to make sure you've correctly understood the problem. The quiz below helps you check if you're solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.