message: Update binary-string-with-substrings-representing-1-to-n.py
diff: @@ -9,6 +9,6 @@ class Solution(object):
  :rtype: bool
  """
  # since S with length n has at most different n-k+1 k-digit numbers
  - # => given S with length n, N is at most 2(n-k+1)
  - # => N <= 2(n-k+1) < 2n = 2 * S.length
  + # => given S with length n, valid N is at most 2(n-k+1)
  + # => valid N <= 2(n-k+1) < 2n = 2 * S.length
  return all(bin(i)[2:] in S for i in reversed(xrange(N//2, N+1)))
  