# Tag Archives: Fibonacci

## 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 whether Array represents a Fibonacci Series or not

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 »

## Check if a number is Full Fibonacci or not

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 »

## Array range queries to find the maximum Fibonacci number with updates

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 »

## Last digit of sum of numbers in the given range in the Fibonacci series

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 »

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

## Count of Fibonacci paths in a Binary tree

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 »

## Array range queries to count the number of Fibonacci numbers with updates

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 »

## Sum of numbers in the Kth level of a Fibonacci triangle

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 »

## Count nodes in the given tree whose weight is a fibonacci number

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 »

## Check if sum of Fibonacci elements in an Array is a Fibonacci number or not

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 »

## GCD of elements occurring Fibonacci number of times in an Array

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 »

## Count numbers divisible by K in a range with Fibonacci digit sum for Q queries

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 »

## Numbers with a Fibonacci difference between Sum of digits at even and odd positions in a given range

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 »

## Sum and product of K smallest and largest Fibonacci numbers in the array

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 »