How many minimum numbers from
fibonacci series are required such that sum of numbers should be equal to a given Number
Note : repetition of number is allowed.
N = 4 Fibonacci numbers : 1 1 2 3 5 .... so on here 2 + 2 = 4 so minimum numbers will be 2
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.