comefrom: <doocs>0522.Longest Uncommon Subsequence II_1.py
code: def check(a, b):
      i = j = 0
      while i < len(a) and j < len(b):
          if a[i] == b[j]:
              j += 1
          i += 1
      return j == len(b)
masked: def sample_funcname ( var_0 , var_1 ) :
      var_4 = var_2 = 0
      while var_4 < len ( var_0 ) and var_2 < len ( var_1 ) :
          if var_0 [ var_4 ] == var_1 [ var_2 ] :
              var_2 += 1
          var_4 += 1
      return var_2 == len ( var_1 )
  