## Count of cells in a matrix which give a Fibonacci number when the count of adjacent cells is added

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 »

- Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
- Last digit of sum of numbers in the given range in the Fibonacci series
- Remove all Fibonacci Nodes from a Circular Singly Linked List
- Count nodes in the given tree whose weight is a fibonacci number
- Sum and product of K smallest and largest Fibonacci numbers in the array
- Count numbers divisible by K in a range with Fibonacci digit sum for Q queries
- Array range queries to count the number of Fibonacci numbers with updates
- Length of longest subsequence of Fibonacci Numbers in an Array
- Find the numbers present at Kth level of a Fibonacci Binary Tree
- Remove all nodes from a Doubly Linked List containing Fibonacci numbers
- Count of Fibonacci paths in a Binary tree
- Sum and Product of all Fibonacci Nodes of a Singly Linked List
- Various operations on Fibonacci nodes in a Singly Linked list
- GCD of elements occurring Fibonacci number of times in an Array
- Sum of numbers in the Kth level of a Fibonacci triangle
- Numbers with a Fibonacci difference between Sum of digits at even and odd positions in a given range
- Count of total subarrays whose sum is a Fibonacci Numbers
- Largest and smallest Fibonacci numbers in an Array
- Length of longest Fibonacci subarray formed by removing only one element
- Count of numbers whose difference with Fibonacci count upto them is atleast K
- Find two Fibonacci numbers whose sum can be represented as N
- Check whether Array represents a Fibonacci Series or not
- Count of Fibonacci pairs with sum N in range 0 to N
- Check if a number is Full Fibonacci or not
- Array range queries to find the maximum Fibonacci number with updates
- Remove all the fibonacci numbers from the given array
- Count of Fibonacci pairs which satisfy the given equation
- Find the next Non-Fibonacci number
- Sum of all Non-Fibonacci numbers in a range for Q queries
- Count of consecutive Fibonacci pairs in the given Array

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 »

In the last post, we discussed Insertion and Union of Fibonacci Heaps. In this post, we will discuss Extract_min(), Decrease_key() and Deletion() operations on Fibonacci… Read More »