Similar Topics

DSA

21k+ articles

Mathematical

7.6k+ articles

Arrays

6.4k+ articles

Searching

1.6k+ articles

Competitive Programming

1.5k+ articles

Dynamic Programming

1.4k+ articles

Hash

1.2k+ articles

Linked List

1.1k+ articles

Recursion

980+ articles

series

540+ articles

Fibonacci

150+ posts

Popular articles

Recent articles

Program to Print Fibonacci Series in Java

Last Updated: 30 July 2023

The Fibonacci series is a series of elements where, the previous two elements are added to get the next element, starting with 0 and 1. In this article, we will learn how ...read more

Dynamic Programming

Memoization (1D, 2D and 3D)

Last Updated: 10 August 2022

Most of the Dynamic Programming problems are solved in two ways:Tabulation: Bottom UpMemoization: Top DownOne of the easier approaches to solve most of the problems in DP ...read more

Dynamic Programming

Time complexity of recursive Fibonacci program

Last Updated: 20 October 2017

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 by the following recursiv ...read more

Similar Topics

DSA

21k+ articles

Mathematical

7.6k+ articles

Arrays

6.4k+ articles

Searching

1.6k+ articles

Competitive Programming

1.5k+ articles

Dynamic Programming

1.4k+ articles

Hash

1.2k+ articles

Linked List

1.1k+ articles

Recursion

980+ articles

series

540+ articles

Sum of Fibonacci Numbers

Last Updated: 13 February 2023

Given a number positive number n, find value of f0 + f1 + f2 + .... + fn where fi indicates i'th Fibonacci number. Remember that f0 = 0, f1 = 1, f2 = 1, f3 = 2, f4 = 3, f5 ...read more

Matrix Exponentiation

Last Updated: 03 October 2023

This is one of the most used techniques in competitive programming. Let us first consider below simple question.What is the minimum time complexity to find n'th Fibonacci ...read more

Dynamic Programming

Competitive Programming

Modular Arithmetic

matrix-exponentiation

Fibonacci Search

Last Updated: 11 October 2023

Given a sorted array arr[] of size n and an element x to be searched in it. Return index of x if it is present in array else return -1.Examples:Input: arr[] = {2, 3, 4, 10...read more

Fibonacci Heap | Set 1 (Introduction)

Last Updated: 19 June 2023

INTRODUCTION:A Fibonacci heap is a data structure used for implementing priority queues. It is a type of heap data structure, but with several improvements over the tradit...read more

Advanced Data Structure

Last Updated: 21 November 2022

Given a "2 x n" board and tiles of size "2 x 1", count the number of ways to tile the given board using the 2 x 1 tiles. A tile can either be placed horizontally i.e., as ...read more

Dynamic Programming

Count Possible Decodings of a given Digit Sequence

Last Updated: 15 April 2023

Let 1 represent 'A', 2 represents 'B', etc. Given a digit sequence, count the number of possible decodings of the given digit sequence.Examples:Input: digits[] = "121"Out ...read more

Dynamic Programming

Count number of binary strings without consecutive 1's

Last Updated: 30 September 2023

Given a positive integer N, count all possible distinct binary strings of length N such that there are no consecutive 1's.Examples:Input: N = 2Output: 3// The 3 strings a ...read more

Dynamic Programming

Program to print first n Fibonacci Numbers | Set 1

Last Updated: 16 February 2023

Given an integer N. The task is to find the first N Fibonacci numbers.Examples :Input: n = 3Output: 0 1 1Input: n = 7Output: 0 1 1 2 3 5 8Recommended: Please solve it on “...read more

Basic Coding Problems

How to check if a given number is Fibonacci number?

Last Updated: 26 October 2023

Given a number ‘n’, how to check if n is a Fibonacci number. First few Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, .. Examples :Input : 8Output : Y ...read more

Overlapping Subproblems Property in Dynamic Programming | DP-1

Last Updated: 08 March 2023

Dynamic Programming is an algorithmic paradigm that solves a given complex problem by breaking it into subproblems using recursion and storing the results of subproblems t...read more

Dynamic Programming

Python Program for n-th Fibonacci number

Last Updated: 26 June 2023

In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relationFn = Fn-1 + Fn-2With seed valuesF0 = 0 and F1 = 1.Python Program for n-th ...read more

Python Programs

Nth Fibonacci Number

Last Updated: 03 October 2023

Given a number n, print n-th Fibonacci Number.The Fibonacci numbers are the numbers in the following integer sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, .........read more

Dynamic Programming

Modular Arithmetic

matrix-exponentiation

1 2 3 4 5 6 7 8 >>