Please help me find a solution of this problem recently asked in a HackerRank round:
Given a target T and number N, write a program 'Solution' to find if the target T can be expressed as sum of N numbers from fibonacci series. Constraints T<=10000000 and N<=100. Output: True, False.
Examples:
Solution(60,4), Output: True
Solution(60,5), Output: False