You are given two strings s and t. Your task is to check whether s is a subsequence of t. A string is called a subsequence if all its characters appear in the same order in the other string, though not necessarily consecutively.
Topics
Companies
Articles
Examples:
N/A
Constraints:
1 = length of s, t = 105
Both strings contain lowercase English letters only
Companies:
AppleMastercard
Topics:
Recursion
Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.
Please log in to access the Solution tab and view detailed answers and explanations.
Please log in to access the Discussion tab and join conversations with other participants.
Access Restricted: Please Login to access the code editor and test cases.