human
Given two strings , find if first string is a subsequence of second | Returns true if str1 [ ] is a subsequence of str2 [ ] ..
Base Cases.
If last characters of two strings are matching.
If last characters are not matching.
Driver program to test the above function"
Solution in Python:
 What is a code to given two strings , find if first string is a subsequence of second and the other steps required?
assistant
#Here is code to given two strings , find if first string is a subsequence of second and the other steps required.
 def isSubSequence ( string1 , string2 , m , n ) :
	if m == 0 :
		return True
	if n == 0 :
		return False
	if string1 [ m - 1 ] == string2 [ n - 1 ] :
		return isSubSequence ( string1 , string2 , m - 1 , n - 1 )
	return isSubSequence ( string1 , string2 , m , n - 1 )
string1 = " gksrek "
string2 = " geeksforgeeks "
if isSubSequence ( string1 , string2 , len ( string1 ) , len ( string2 ) ) :
	print " Yes "
else :
	print " No "