<p>Given a binary string <code>s</code> and a positive integer <code>n</code>, return <code>true</code><em> if the binary representation of all the integers in the range </em><code>[1, n]</code><em> are <strong>substrings</strong> of </em><code>s</code><em>, or </em><code>false</code><em> otherwise</em>.</p>

<p>A <strong>substring</strong> is a contiguous sequence of characters within a string.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> s = "0110", n = 3
<strong>Output:</strong> true
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> s = "0110", n = 4
<strong>Output:</strong> false
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s[i]</code> is either <code>&#39;0&#39;</code> or <code>&#39;1&#39;</code>.</li>
	<li><code>1 &lt;= n &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution {
public:
    bool queryString(string s, int n) {
        vector<bool> sets(n+1, false);
        

        int sum = 0;
        for(int i=0;i<s.length(); i++)
        {
           while(i<s.length() && s[i] == 0)
           {
                i++;
           }
           sum = 0;
           for(int j=i; j<s.length() && j-i+1<31; j++)
           {
                sum+=(s[j] - '0');
               // cout<<i<<" "<<j<<" ";
                if (sum<=n)
                sets[sum] = true;
                     
                sum=sum*2;

           }
         }
        for(int i=1;i<=n; i++)
           if (sets[i] == false)
             return false;


        return true;
    }
};
145100