0
Search fibanocci number
Given an integer n, search for the set of all fibanocci numbers F ={f1 U f2 U f3 ....fn} where fi is the set of fibanocci numbers of length "i" and present in the number 'n'. A number in fi is formed by taking I consecutive digits from n. For example if the value of n is 121393 then f1 = {1,2,3} f2 = {13,21} f3 = {} and f6 = {121393} hence F = {1,2,3,13,21,121383} If no fibanocci number is present then print None
1 Answer
+ 4
Do you have a question?
Maybe you want to include a code that doesn't work? (Attach it from the code playground)