# Tag Archives: Fibonacci

## Deriving the expression of Fibonacci Numbers in terms of golden ratio

Prerequisites: Generating Functions, Fibonacci Numbers, Methods to find Fibonacci numbers. The method of using Generating Functions to solve the famous and useful Fibonacci Numbers‘ recurrence… Read More »

## Sudo Placement 2 | Matrix Series

A Matrix series is defined as follows: M, MT, M(MT), M(MT)2, M2(MT)3, M3(MT)5, M5(MT)8 . . . . . . . ., where M is a… Read More »

## Total number of ways to place X and Y at n places such that no two X are together

Given N positions, the task is to count the total number of ways to place X and Y such that no two X are together.… Read More »

## Check if a M-th fibonacci number divides N-th fibonacci number

Given two numbers M and N, the task is to check if the M-th and N-th Fibonacci numbers perfectly divide each other or not. Examples:… Read More »

## Memoization (1D, 2D and 3D)

Most of the Dynamic Programming problems are solved in two ways: Tabulation: Bottom Up Memoization: Top Down One of the easier approaches to solve most… Read More »

## Print first n Fibonacci Numbers using direct formula

Given a number n, the task is to print first n Fibonacci numbers. Prerequisite : Program to print first n Fibonacci Numbers | Set 1… Read More »

## Check if the n-th term is odd or even in a Fibonacci like sequence

Consider a sequence a0, a1, …, an, where ai = ai-1 + ai-2. Given a0, a1 and a positive integer n. The task is to… Read More »

## Find n terms of Fibonacci type series with given first two terms

Given first two numbers of series, find n terms of series with these two numbers. The given series follows the same concept as Fibonacci series,… Read More »

## Print Fibonacci sequence using 2 variables

Print the Fibonacci sequence. The first Fibonacci numbers are: C++ filter_none edit close play_arrow link brightness_4 code // Simple CPP Program to print Fibonacci  //… Read More »

## N-bonacci Numbers

You are given two Integers N and M, and print all the terms of the series upto M-terms of the N-bonacci Numbers. For example, when… Read More »

## Number of ways an array can be filled with 0s and 1s such that no consecutive elements are 1

Given a number N, find the number of ways to construct an array of size N such that it contains only 1s and 0s but… Read More »

## Fibonacci sum of a subset with all elements <= k

Given an array of n elements, the task is to find the fibonacci sum of a subset of the array where every element of the… Read More »

## Fibonacci Cube Graph

You are given input as order of graph n (highest number of edges connected to a node), you have to find the number of vertices… Read More »

## Minimum Fibonacci terms with sum equal to K

Given a number k, find the required minimum number of Fibonacci terms whose sum equal to k. We can choose a Fibonacci number multiple times.… Read More »

## Generating large Fibonacci numbers using boost library

In our previous post on fibonacci series, we have seen many approaches to generate fibonacci numbers. In this approach, we shall be generating fibonacci numbers… Read More »