Give a string s, count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively.
#In this challenge, the user enters a string and a substring. You have to print the number of times that the substring occurs #in the given string. String traversal will take place from left to right, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback