human
Bitwise AND of N binary strings | this function takes two unequal sized bit strings , converts them to same length by adding leading 0 s in the smaller string . Returns the the new length.
Return len_b which is highest . No need to proceed further !.
Return len_a which is greater or equal to len_b.
The main function that performs AND operation of two - bit sequences and returns the resultant string.
Make both strings of same length with the maximum length of s1 & s2 ..
Initialize res as NULL string.
We start from left to right as we have made both strings of same length ..
Convert s1 [ i ] and s2 [ i ] to int and perform bitwise AND operation , append to " res " string.
Driver Code.
Check corner case : If there is just one binary string , then print it and return ."
Solution in Python:

=====
What is a code to bitwise AND of N binary strings and the other steps required?
assistant
#Here is code to bitwise AND of N binary strings and the other steps required.
 def makeEqualLength ( a , b ) :
	len_a = len ( a )
	len_b = len ( b )
	num_zeros = abs ( len_a - len_b )
	if ( len_a < len_b ) :
		for i in range ( num_zeros ) :
			a = '0' + a
		return len_b , a , b
	else :
		for i in range ( num_zeros ) :
			b = '0' + b
	return len_a , a , b
def andOperationBitwise ( s1 , s2 ) :
	length , s1 , s2 = makeEqualLength ( s1 , s2 )
	res = " "
	for i in range ( length ) :
		res = res + str ( int ( s1 [ i ] ) & int ( s2 [ i ] ) )
	return res
arr = [ "101" , "110110" , "111" ]
n = len ( arr )
if ( n < 2 ) :
	print ( arr [ n - 1 ] )
else :
	result = arr [ 0 ]
	for i in range ( n ) :
		result = andOperationBitwise ( result , arr [ i ] ) ;
	print ( result )