The original challenge description can be found here
Given an array with positive number the task is that we find largest subset from array that contain elements which are Fibonacci numbers.
Input : [1, 4, 3, 9, 10, 13, 7]
Output : [1, 3, 13]
Input : [0, 2, 8, 5, 2, 1, 4, 13, 23]
Output : [0, 2, 8, 5, 2, 1, 13, 23]