Fibonacci Sequence is a series of numbers starting with 0 and 1 in which each number, is generated by adding the two preceding numbers. It is a special sequence of numbers that starts from 0 and 1 and then the next terms are the sum of the previous terms and they go up to infinite terms.
Example problems based on Fibonacci
Easy
- Print Fibonacci Series
- First n Fibonacci Numbers
- Sum of Fibonacci Numbers
- Nth Fibonacci Number
- Nearest Fibonacci Number
- Previous Fibonacci Number
- Check Fibonacci Number
- Fibonacci Number in Array
- Fibonacci Triangle
- Full Fibonacci
- Last digit of n’th Fibonacci Number
- Last digit of Sum of Numbers
Medium
- Prime Fibonacci Numbers
- K- Fibonacci Series
- Largest Subset of Fibonacci Number
- Count ways to reach Nth Stair
- Paint Stairs with Two colors
- Fibonacci jumps to reach end
- Represent number as Sum of 1’s and 2’s
- Sum of squares of Fibonacci Numbers
- Fibonacci Power
- Non Fibonacci Numbers
Hard
- Fast Doubling Method
- Range Sum of Fibonacci Numbers
- Pisano Period
- Leonardo Number
- Tiling Problem
- Maximum games played by Winner
- Minimum Fibonacci K Sum
- Possible ways to Construct Buildings
- Binary Strings without Consecutive 1's
- Hosoya’s Triangle
- Fibonacci paths in a Binary tree
- Nth term in the series 0, 2, 1, 3, 1, 5, 2, 7, 3,…
Related Articles