Solving Is Subsequence in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Example 1:

Example 2:

**Follow up:**If there are lots of incoming S, say S1, S2, ... , Sk where k >= 1B, and you want to check one by one to see if T has its subsequence. In this scenario, how would you change your code?

See the full details of the problem Is Subsequence at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go