Count of total subarrays whose sum is a Fibonacci Numbers
Given an array arr[] of N integers, the task is to count total number of subarrays whose sum is a Fibonacci Number.Examples: Input: arr[] = {6, 7, 8, 9} Output: 3 Explanation: The subarray whose sum is fibonacci numbers are: 1. {6, 7}, sum = 13 (5 + 8) 2. {6, 7, 8}, sum = 21 (8 + 13) 3. {8}, sum = 8