This challenge was inspired from a Project Euler
After converting a fraction into a floating point number, find the recurring cycle if there is one.
1/2 = 0.5
1/3 = 0.333333333333333333333 = 3
1/6 = 0.166666666666666666666 = 6
1/7 = 0.142857142857142857142 = 142857
1/9 = 0.111111111111111111111 = 1
This isn't a hard problem but I found it fun enough to share. Solve it any which way you want but bonus points for creativity. Since precision could be an issue, just assume that the provided string will be long enough for the recurring cycle to appear in its entirety at least twice. My solution is terribly inefficient and I will post it tomorrow.