human
Count substring of Binary string such that each character belongs to a palindrome of size greater than 1 | Function to find the substrings in binary string such that every character belongs to a palindrome.
Total substrings.
Loop to store the count of continuous characters in the given string.
Subtract non special strings from answer.
Driver Code.
Given string.
Function call"
Solution in Python:

Write me a code to count substring of Binary string such that each character belongs to a palindrome of size greater than 1 and the other steps required?
assistant
#Here is code to count substring of Binary string such that each character belongs to a palindrome of size greater than 1 and the other steps required.
 def countSubstrings ( s ) :
	n = len ( s )
	answer = ( n * ( n - 1 ) ) // 2
	cnt = 1
	v = [ ]
	for i in range ( 1 , n ) :
		if ( s [ i ] == s [ i - 1 ] ) :
			cnt += 1
		else :
			v . append ( cnt )
			cnt = 1
	if ( cnt > 0 ) :
		v . append ( cnt )
	for i in range ( len ( v ) - 1 ) :
		answer -= ( v [ i ] + v [ i + 1 ] - 1 )
	return answer
if __name__ == ' _ _ main _ _ ' :
	s = "00111"
	print ( countSubstrings ( s ) )