## Count non-adjacent subsets from numbers arranged in Circular fashion

Given that N people are sitting in a circular queue numbered from 1 to N, the task is to count the number of ways to… Read More »

- Minimum number of Fibonacci jumps to reach end
- Nth XOR Fibonacci number
- Fibonacci Power
- Fibonacci Number modulo M and Pisano Period
- Count the nodes whose sum with X is a Fibonacci number
- Count of cells in a matrix which give a Fibonacci number when the count of adjacent cells is added
- Find F(n) when F(i) and F(j) of a sequence are given
- Nth Fibonacci number using Pell's equation
- Find the next fibonacci number
- Find the previous fibonacci number
- Find the Nth element of the modified Fibonacci series
- Program to find Nth odd Fibonacci Number
- C++ Program to print Fibonacci Series using Class template

Given that N people are sitting in a circular queue numbered from 1 to N, the task is to count the number of ways to… Read More »

Given a Fibonacci number N, the task is to find the previous Fibonacci number. Examples: Input: N = 8 Output: 5 5 is the previous… Read More »

Given a fibonacci number N, the task is to find the next fibonacci number. Examples: Input: N = 5 Output: 8 8 is the next… Read More »

Given an integer N. The task is to find the Nth odd Fibonacci number. The odd number fibonacci series is as: 1, 1, 3, 5,… Read More »

Given a number n, the task is to write a program in C++ to print the n-terms of Fibonacci Series using a Class template The… Read More »

Given two integers A and B which are the first two terms of the series and another integer N. The task is to find the… Read More »

Given five integers i, Fi, j, Fj and N. Where Fi and Fj are the ith and jth term of a sequence which follows the… Read More »

Given two number N and M. The task is to find the N-th fibonacci number mod M. In general let FN be the N-th fibonacci… Read More »

Given an integer N, the task is to find the Nth Fibonacci number. Input: N = 13 Output: 144 Input: N = 19 Output: 2584… Read More »

Given three integers a, b and N where a and b are the first two terms of the XOR Fibonacci series and the task is… Read More »

Given an array of 0s and 1s, If any particular index i has value 1 then it is a safe index and if the value… Read More »

Given a number n. You are required to find ( Fib(n) ^ Fib(n) ) % 10^9 + 7, where Fib(n) is the nth fibonacci number.… Read More »

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 »