Add py solution for 392. Is Subsequence
Add py solution for 392. Is Subsequence

392. Is Subsequence: https://leetcode.com/problems/is-subsequence/

Approach:
    Observe the first item remaining in each step. The value will be added
    1 << step either the remaining count is odd or it's a left-to-right
    step. Hence the n | 0x55555.. is the key.

ckclark/leetcode,ckclark/leetcode,ckclark/leetcode,ckclark/leetcode,ckclark/leetcode,ckclark/leetcode