<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:
    
    long long changeToInteger(string &s, int &maxNum){
        int n = s.size();
        long long ans = 0;
        for(int i=n-1;i>=0;i--){
            if(s[i]=='1'){
                long long currValue = pow(2,n-1-i);
                if(currValue>maxNum){
                    return -1;
                }
                ans+=currValue;
                if(ans>maxNum){
                    return -1;
                }
            }
        }
        return ans;
    }
    
    bool queryString(string s, int n) {
        unordered_set<long long> nums;
        
        int stringSize = s.size();
        for(int i=0;i<stringSize;i++){
            string currString = "";
            currString += s[i];
            int value = changeToInteger(currString, n);
            if(value>0 && value<=n){
                //cout<<value<<endl;
                nums.insert(value);
            }
            //cout<<currString<<endl;
            for(int j=i+1;j<stringSize;j++){
                currString+=s[j];
                //cout<<currString<<endl;
                long long numValue = changeToInteger(currString, n);
                if(numValue>0 && numValue<=n){
                    //cout<<numValue<<endl;
                    nums.insert(numValue);
                } 
            }
        }
        
        return (nums.size()==n);
    }
};
19800