Beautiful Binary String

  • + 0 comments

    My Java solution:

     public static int beautifulBinaryString(String b) {
            //goal: determine min removals to a string not have 010
            int min = 0;
            for (int i = 0; i < b.length() - 2; i++) {
                if (b.substring(i, i + 3).equals("010")) {
                    min++;
                    i += 2; // Skip next two characters to avoid overlapping patterns
                }
            }
            return min;
        }