comefrom: <doocs>2350.Shortest Impossible Sequence of Rolls_1.py
code: def shortestSequence( rolls: List[int], k: int) -> int:
      ans = 1
      s = set()
      for v in rolls:
          s.add(v)
          if len(s) == k:
              ans += 1
              s.clear()
      return ans
masked: def sample_funcname ( var_0 : List [ int ] , var_3 : int ) -> int :
      var_5 = 1
      var_7 = set ( )
      for var_8 in var_0 :
          var_7.add ( var_8 )
          if len ( var_7 ) == var_3 :
              var_5 += 1
              var_7.clear ( )
      return var_5
  