human
Count strings with consecutive 1 's | Returns count of n length binary strings with consecutive 1 's.
Count binary strings without consecutive 1 's.  See the approach discussed on be  ( http:goo.gl/p8A3sW ).
Subtract a [ n - 1 ] + b [ n - 1 ] from 2 ^ n.
Driver code"
Solution in Python:
 ... Give me a code to count strings with consecutive 1 's and the other steps required?
assistant
#Here is code to count strings with consecutive 1 's and the other steps required.
 def countStrings ( n ) :
	a = [ 0 ] * n
	b = [ 0 ] * n
	a [ 0 ] = b [ 0 ] = 1
	for i in range ( 1 , n ) :
		a [ i ] = a [ i - 1 ] + b [ i - 1 ]
		b [ i ] = a [ i - 1 ]
	return ( 1 << n ) - a [ n - 1 ] - b [ n - 1 ]
print ( countStrings ( 5 ) )