Longest sub string of 0’s in a Binary string
Given a string S containing 0’s and 1’s, the task is to find the length of longest continuous substring of 0’s from the given string. Examples: Input: S = 1111111 Output: 0 Explanation: There is no substring of 0’s hence output is 0. Approach: The given problem can be solved by simply iterating through the string. Follow the… Read More »