[LeetCode] Top Interview 150 Problems Solving # 392 Is Subsequence

Understanding the Problem Given strings s and t, it is to tell whether s is the subsequence to t. It is not finding if the characters in s exist in t. Well basically it is, but the sequence matters too. # example Input: s = "abc", t = "ahbgdc" Output...