## Program to find last two digits of Nth Fibonacci number

Given a number ‘n’, write a function that prints the last two digits of n-th (‘n’ can also be a large number) Fibonacci number. Examples:… Read More »

- Fibonacci Heap - Insertion and Union
- Fibonacci Heap - Deletion, Extract min and Decrease key
- Find length of longest Fibonacci like subsequence
- Find the longest Fibonacci-like subarray of the given array
- Find the sum of first N odd Fibonacci numbers
- Program to find LCM of two Fibonnaci Numbers
- Sum of squares of Fibonacci numbers
- K- Fibonacci series
- Sum of Fibonacci numbers at even indexes upto N terms
- Program to find first N Iccanobif Numbers
- Fibonacci problem (Value of Fib(N)*Fib(N) - Fib(N-1) * Fib(N+1))
- Minimum number of elements to be replaced to make the given array a Fibonacci Sequence
- Sum of Fibonacci Numbers with alternate negatives
- Sum of nth terms of Modified Fibonacci series made by every pair of two arrays
- Check whether frequency of characters in a string makes Fibonacci Sequence

Given a number ‘n’, write a function that prints the last two digits of n-th (‘n’ can also be a large number) Fibonacci number. Examples:… Read More »

Given n stairs and we have 2 colour yellow and green the task is that we have to paint given stairs by given colour with… Read More »

Given a number, find the numbers (smaller than or equal to n) which are both Fibonacci and prime. Examples: Input : n = 40 Output:… Read More »

Given an positive integer n. Count total number of ways to express ‘n’ as sum of odd positive integers. Input: 4 Output: 3 Explanation There… Read More »

The Fibonacci numbers are the numbers in the following integer sequence 0, 1, 1, 2, 3, 5, 8, 13… Mathematically Fibonacci numbers can be written… Read More »

The Leonardo numbers are a sequence of numbers given by the recurrence: The first few Leonardo Numbers are 1, 1, 3, 5, 9, 15, 25,… Read More »

There are N players which are playing a tournament. We need to find the maximum number of games the winner can play. In this tournament,… Read More »

We have been given an array and our task is to check if the element of array is present in Fibonacci series or not. If… Read More »

Given a number N, the task is to evaluate below expression. Expected time complexity is O(1). f(n-1)*f(n+1) – f(n)*f(n) Where f(n) is the n-th Fibonacci… Read More »

The Fibonacci sequence is defined as = + where = 1 and = 1 are the seeds. For a given prime number p, consider a… Read More »

We know Fibonacci number, Fn = Fn-1 + Fn-2. First few Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,… Read More »

We are given a variable n, we need to find whether Fibonacci number will be multiple of 10 or not. Examples: Input : 15 Output… Read More »

Given an array with positive number the task is that we find largest subset from array that contain elements which are Fibonacci numbers. Asked in… Read More »

We are given a Fibonacci number. First few Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, …..… Read More »

Write a tail recursive function for calculating the n-th Fibonacci number. Examples : Input : n = 4 Output : fib(4) = 3 Input :… Read More »