For this Question: Given a binary string s and a positive integer n, return true if the binary representation of all the integers in the range [1, n] are substrings of s, or false otherwise.

A substring is a contiguous sequence of characters within a string.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>queryString()</b> that takes string "s" and Integer "n" as parameters.

<b>Constraints:</b>
1 &le; s.length &le; 1000
s[i] is either '0' or '1'.
1 &le; n &le; 10<sup>9</sup>Return true if the binary representation of all the integers in the range [1, n] are substrings of s, or false otherwise.Sample 1:
Input: s = "0110", n = 3
Output: true

Sample 2:
Input: s = "0110", n = 4
Output: false, I have written this Solution Code: 
class Solution {
     public boolean queryString(String S, int N) {
        for (int i = 1; i <= N; ++i)
            if (!S.contains(Integer.toBinaryString(i)))
                return false;
        return true;
    }
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not?