Leetcode: Binary String With Substrings Representing 1 To N

Binary String With Substrings Representing 1 To N



Similar Problems:


Given a binary string S (a string consisting only of ‘0’ and ‘1’s) and a positive integer N, return true if and only if for every integer X from 1 to N, the binary representation of X is a substring of S.

Example 1:

Input: S = "0110", N = 3
Output: true

Example 2:

Input: S = "0110", N = 4
Output: false

Note:

  1. 1 <= S.length <= 1000
  2. 1 <= N <= 10^9

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.


  • Solution: XXX

General Thinkings:


Key Observations:


Walk Through Testdata


// Blog link: https://code.dennyzhang.com/binary-string-with-substrings-representing-1-to-n

linkedin
github
slack

Share It, If You Like It.

Leave a Reply

Your email address will not be published.