## Fibonacci Power

Given a number n. You are required to find ( Fib(n) ^ Fib(n) ) % 10^9 + 7, where Fib(n) is the nth fibonacci number.… Read More »

- Program to find LCM of two Fibonnaci Numbers
- Find the longest Fibonacci-like subarray of the given array
- Sum of Fibonacci Numbers in a range
- Program to find first N Iccanobif Numbers
- Python | Find fibonacci series upto n using lambda
- Find the Nth term of the series where each term f[i] = f[i - 1] - f[i - 2]
- Count the nodes whose sum with X is a Fibonacci number
- Distinct pairs from given arrays (a[i], b[j]) such that (a[i] + b[j]) is a Fibonacci number
- Count of cells in a matrix which give a Fibonacci number when the count of adjacent cells is added

Given a number n. You are required to find ( Fib(n) ^ Fib(n) ) % 10^9 + 7, where Fib(n) is the nth fibonacci number.… Read More »

Given an M x N matrix mat[][]. The task is to count the number of good cells in the matrix. A cell will be good… Read More »

Given a tree, and the weights of all the nodes and an integer X, the task is to count all the nodes i such that… Read More »

Given two arrays a[] and b[], the task is to count the pairs (a[i], b[j]) such that (a[i] + b[j]) is a Fibonacci number.Note that… Read More »

Given a range [l, r], the task is to find the sum fib(l) + fib(l + 1) + fib(l + 2) + ….. + fib(r)… Read More »

The Fibonacci numbers are the numbers in the following integer sequence. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ……..… Read More »

Given three integers X, Y and N, the task is to find the Nth term of the series f[i] = f[i – 1] – f[i… Read More »

Given an array of N elements, the task is to find the longest subarray which is Fibonacci-like. A Fibonacci-like sub-array is defined as an array… Read More »

Given here are two positive numbers a and b. The task is to print the least common multiple of a’th and b’th Fibonacci Numbers. The… Read More »

Given a number N. The task is to find first N Iccanobif Numbers. Iccanobif Numbers are similar to Fibonacci Numbers. The K-th Iccanobif number can… Read More »

Given a positive integer N, the task is to find Fib(N)2 – (Fib(N-1) * Fib(N+1)) where Fib(N) returns the Nth Fibonacci number. Examples: Input: N… Read More »

Given an array arr containing N integer elements, the task is to count the minimum number of elements that need to be changed such that… Read More »

Given a number, N. find the sum of first N odd Fibonacci numbers. Note: The answer can be very large so print the answer modulo… Read More »

Given a string with lowercase English alphabets. The task is to check whether the frequency of the characters in the string can be arranged as… Read More »

Given a strictly increasing array A of positive integers where, . The task is to find the length of the longest Fibonacci-like subsequence of A.… Read More »