Given a binary string str, the task is to find the count of non-overlapping sub-strings of either the form “010” or “101”.
Input: str = “10101010101”
str[0..2] = “101”
str[3..5] = “010”
str[6..8] = “101”
Input: str = “111111111111110”
Approach: Initialise count = 0 and for every index i in the given string check whether the sub-string of size 3 starting at the current index i matches either with “010” or “101”. If its a match then update count = count + 1 and i = i + 3 (to avoid overlapping of sub-strings) else increment i by 1.
Below is the implementation of the above approach:
- Count of substrings of a binary string containing K ones
- Given a binary string, count number of substrings that start and end with 1.
- Number of substrings with odd decimal value in a binary string
- Counting even decimal value substrings in a binary string
- Split the binary string into substrings with equal number of 0s and 1s
- Count of distinct substrings of a string using Suffix Array
- Count number of substrings of a string consisting of same characters
- Count of distinct substrings of a string using Suffix Trie
- Count the number of vowels occurring in all the substrings of given string
- Queries to find the count of vowels in the substrings of the given string
- Count of cyclic permutations having XOR with other binary string as 0
- Count of operations to make a binary string"ab" free
- Count substrings with same first and last characters
- Count substrings that contain all vowels | SET 2
- Count all substrings having character K
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.