Skip to content

Tag Archives: Fibonacci

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
Prerequisites: Binary Search Given two positive integers N and K, the task is to count all the numbers that satisfy the following conditions: If the… Read More
Given a number N, the task is to find the count of Fibonacci pairs in range 0 to N whose sum is N. Examples:  Input:… Read More