Check if a binary string contains all permutations of length k

// Java program to Check a binary string
// contains all permutations of length k.

import java.util.*;
public class Checkbinary {

    // to check all Permutation in given String
    public static boolean tocheck(String s, int k)
    {
        List<String> list = BinarySubsets(k);

        // to check binary sequences are available 
        // in string or not
        for (String b : list) 
            if (s.indexOf(b) == -1)
                return false;        

        return true;
    }

    // to generate all binary subsets of given length k
    public static List<String> BinarySubsets(int k)
    {
        // Declare the list as String
        List<String> list = new ArrayList<>();

        // to define the format of binary of 
        // given length k
        String format = "%0" + k + "d";

        // returns the string representation of the
        // unsigned integer value represented by
        // the argument in binary (base 2)  using
        // Integer.toBinaryString and convert it
        // into integer using Integer.valueOf.
        // Loop for 2<sup>k</sup> elements
        for (int i = 0; i < Math.pow(2, k); i++) 
        {
            // To add in the list all possible 
            // binary sequence of given length
            list.add(String.format(format,
                Integer.valueOf(Integer.toBinaryString(i))));

            /* To Show all binary sequence of given 
               length k 
            System.out.println(String.format(format,
            Integer.valueOf(Integer.toBinaryString(i))));*/
        }
        return list;
    }

    // drive main
    public static void main(String[] args)
    {
        String str = "11001";
        int num = 2;
        if (tocheck(str, num))
            System.out.println("Yes");
        else
            System.out.println("No");
    }
}

// Java Program to Check If a 
// String Contains All Binary
// Codes of Size K
import java.io.*;
import java.util.*;
class GFG
{
    static boolean hasAllcodes(String s, int k)
    {
      
        // Unordered map of type string
        Set<String> us= new HashSet<String>();
        for(int i = 0; i + k <= s.length(); i++)
        {
            us.add(s.substring(i, i + k));
        }
        return (us.size() == (1 << k));
    }
  
    // Driver code
    public static void main (String[] args) 
    {
        String s = "00110110";
        int k = 2;
        if(hasAllcodes(s, k))
        {
            System.out.println("YES");
        }
        else
        {
            System.out.println("NO");
        }
    }
}

//  This code is contributed by avanitrachhadiya2155

// Java program to implement the approach
import java.util.*;

class GFG {

  // Method to check if the string contnains 
  // all the binary codes of size k
  static boolean hasAllCodes(String s, int k)
  {
    int n = s.length();
    if (n < k)
      return false;
    int size = (int)Math.pow(2, k);

    // ArrayList that tracks if a certain code
    // has been found
    ArrayList<Boolean> visited
      = new ArrayList<Boolean>();
    for (int i = 0; i < size; i++)
      visited.add(false);

    int i = 0;
    int j = 0;
    int val = 0;
    while (j < k - 1) {
      val = 2 * val + (s.charAt(j) - '0');
      j++;
    }
    while (j < n) {
      val = 2 * val + (s.charAt(j) - '0');
      visited.set(val, true);
      if (s.charAt(i) == '1')
        val -= (int)Math.pow(2, k - 1);
      j++;
      i++;
    }

    // Checking if all the codes have been found
    for (i = 0; i < size; i++) {
      if (!visited.get(i))
        return false;
    }
    return true;
  }

  // Driver Code
  public static void main(String[] args)
  {

    String s = "00110110";
    int k = 2;

    // Function call
    if (hasAllCodes(s, k)) {
      System.out.print("YES\n");
    }
    else {
      System.out.print("NO\n");
    }
  }
}

// This code is contributed by phasing17