human
Find Recurring Sequence in a Fraction | This function returns repeating sequence of a fraction . If repeating sequence doesn 't exits, then returns empty string.
Initialize result.
Create a map to store already seen remainders . Remainder is used as key and its position in result is stored as value . Note that we need position for cases like 1 / 6. In this case , the recurring sequence doesn 't start  from first remainder..
Find first remainder.
Keep finding remainder until either remainder becomes 0 or repeats.
Store this remainder.
Multiply remainder with 10.
Append rem / denr to result.
Update remainder.
Driver code"
Solution in Python:

What is a code to find Recurring Sequence in a Fraction and the other steps required?
assistant
#Here is code to find Recurring Sequence in a Fraction and the other steps required.
 def fractionToDecimal ( numr , denr ) :
	res = " "
	mp = { }
	rem = numr % denr
	while ( ( rem != 0 ) and ( rem not in mp ) ) :
		mp [ rem ] = len ( res )
		rem = rem * 10
		res_part = rem // denr
		res += str ( res_part )
		rem = rem % denr
	if ( rem == 0 ) :
		return " "
	else :
		return res [ mp [ rem ] : ]
numr , denr = 50 , 22
res = fractionToDecimal ( numr , denr )
if ( res == " " ) :
	print ( " No ▁ recurring ▁ sequence " )
else :
	print ( " Recurring ▁ sequence ▁ is " , res )