## Fast Doubling method to find the Nth Fibonacci number

Given an integer N, the task is to find the N-th Fibonacci numbers. Examples: Input: N = 3 Output: 2 Explanation: F(1) = 1, F(2)… 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 integer N, the task is to find the N-th Fibonacci numbers. Examples: Input: N = 3 Output: 2 Explanation: F(1) = 1, F(2)… Read More »

Given an array arr[] consisting of N integers, the task is to check whether a Fibonacci series can be formed using all the array elements… Read More »

Given a number N, the task is to check if the given number and all its digits are Fibonacci. If so, then the given number… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: maximum(start, end): Print the maximum Fibonacci number of elements… Read More »

Given two non-negative integers M, N which signifies the range [M, N] where M ≤ N, the task is to find the last digit of… Read More »

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[]… Read More »

Given a Binary Tree, the task is to count the number of Fibonacci paths in the given Binary Tree. Fibonacci Path is a path which… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: query(start, end): Print the number of fibonacci numbers in… Read More »

Given a number K, the task is to find the sum of numbers at the Kth level of the Fibonacci triangle. Examples: Input: K =… Read More »

Given a tree with the weights of all the nodes, the task is to count the number of nodes whose weight is a Fibonacci number.… Read More »

Given an array arr[] containing N elements, the task is to check if the sum of Fibonacci elements of the array is a fibonacci number… Read More »

Given an array arr[] containing N elements, the task is to find the GCD of the elements which have frequency count which is a Fibonacci… Read More »

Given an array arr[][] containing Q queries and an integer K where each query consists of a range [L, R], the task is to find… Read More »

Prerequisites: Digit DP Given a range [L, R], the task is to count the numbers in this range having the difference between, the sum of… Read More »

Given an integer K and an array arr[] containing N integers, the task is to find the sum and product of K smallest and K… Read More »