human
Lexicographic rank of a Binary String | Function to find the rank of a string.
Store the length of the string.
Stores its equivalent decimal value.
Traverse the string.
Store the number of strings of length less than N occurring before the given string.
Store the decimal equivalent number of string bin.
Store the rank in answer.
Prthe answer.
Driver Code"
How can the above be solved in Python?
 ... Write me a code to lexicographic rank of a Binary String and the other steps required?
assistant
#Here is code to lexicographic rank of a Binary String and the other steps required.
 def findRank ( s ) :
	N = len ( s ) ;
	sb = " " ;
	for i in range ( 0 , N ) :
		if ( s [ i ] == '0' ) :
			sb += str ( '0' ) ;
		else :
			sb += str ( '1' ) ;
	bin = str ( sb ) ;
	X = pow ( 2 , N ) ;
	Y = int ( bin ) ;
	ans = X + Y - 1 ;
	print ( ans ) ;
if __name__ == ' _ _ main _ _ ' :
	S = "001" ;
	findRank ( S ) ;