human
Maximum length of balanced string after swapping and removal of characters | Function to return the length of the longest balanced sub - string.
To store the count of parentheses.
Traversing the string.
Check type of parentheses and incrementing count for it.
Sum all pair of balanced parentheses.
Driven code"
Solution in Python:

Write me a code to maximum length of balanced string after swapping and removal of characters and the other steps required?
assistant
#Here is code to maximum length of balanced string after swapping and removal of characters and the other steps required.
 def maxBalancedStr ( s ) :
	open1 = 0
	close1 = 0
	open2 = 0
	close2 = 0
	open3 = 0
	close3 = 0
	for i in range ( len ( s ) ) :
		if ( s [ i ] == ' ( ' ) : open1 += 1 continue if s [ i ] == ' ) ' :
			close1 += 1
			continue
		if s [ i ] == ' { ' :
			open2 += 1
			continue
		if s [ i ] == ' } ' :
			close2 += 1
			continue
		if s [ i ] == ' [ ' :
			open3 += 1
			continue
		if s [ i ] == ' ] ' :
			close3 += 1
			continue
	maxLen = ( 2 * min ( open1 , close1 ) + 2 * min ( open2 , close2 ) + 2 * min ( open3 , close3 ) )
	return maxLen
if __name__ == ' _ _ main _ _ ' : s = " ) ) [ ] ] ( ( "
	print ( maxBalancedStr ( s ) )