| Action | Tickets Earned |
|---|---|
Complete Daily Challenge | +1 |
10-Day Streak | +10 |
20-Day Streak | +20 |
30-Day Streak | +30 |
LinkedIn post with #30DaysofCode Everyday (and tag Educative) | +2 per post |
Most-Liked Post Overall | +20 |
Top of Leaderboard | +50 |
Leaderboard: 2nd place | +30 |
Leaderboard: 3rd place | +20 |
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:
s.length
t.length
s and t consist only of lowercase English letters.
| Action | Tickets Earned |
|---|---|
Complete Daily Challenge | +1 |
10-Day Streak | +10 |
20-Day Streak | +20 |
30-Day Streak | +30 |
LinkedIn post with #30DaysofCode Everyday (and tag Educative) | +2 per post |
Most-Liked Post Overall | +20 |
Top of Leaderboard | +50 |
Leaderboard: 2nd place | +30 |
Leaderboard: 3rd place | +20 |
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:
s.length
t.length
s and t consist only of lowercase English letters.