## Tribonacci Word

Like Fibonacci word, a Tribonacci word. is a specific sequence of digits. The Tribonacci word is formed by repeated concatenation in the same way that… Read More »

- Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
- Last digit of sum of numbers in the given range in the Fibonacci series
- C Program to print Fibonacci Series without using loop
- Remove all Fibonacci Nodes from a Circular Singly Linked List
- Count nodes in the given tree whose weight is a fibonacci number
- Sum and product of K smallest and largest Fibonacci numbers in the array
- Remove all nodes from a Doubly Linked List containing Fibonacci numbers
- Array range queries to count the number of Fibonacci numbers with updates
- Count numbers divisible by K in a range with Fibonacci digit sum for Q queries
- Length of longest subsequence of Fibonacci Numbers in an Array
- Prime Fibonnaci | TCS Mockvita 2020
- Split a Numeric String into Fibonacci Sequence
- Find the numbers present at Kth level of a Fibonacci Binary Tree
- Count of Fibonacci paths in a Binary tree
- Sum and Product of all Fibonacci Nodes of a Singly Linked List
- Fast Doubling method to find the Nth Fibonacci number
- Various operations on Fibonacci nodes in a Singly Linked list
- GCD of elements occurring Fibonacci number of times in an Array
- Sum of numbers in the Kth level of a Fibonacci triangle
- Count of total subarrays whose sum is a Fibonacci Numbers
- Length of longest Fibonacci subarray formed by removing only one element
- Largest and smallest Fibonacci numbers in an Array
- Numbers with a Fibonacci difference between Sum of digits at even and odd positions in a given range
- Nth Term of a Fibonacci Series of Primes formed by concatenating pairs of Primes in a given range
- Check whether Array represents a Fibonacci Series or not
- Check if a number is Full Fibonacci or not
- Find two Fibonacci numbers whose sum can be represented as N
- Array range queries to find the maximum Fibonacci number with updates
- Count of numbers whose difference with Fibonacci count upto them is atleast K
- 3 Different ways to print Fibonacci series in Java

Like Fibonacci word, a Tribonacci word. is a specific sequence of digits. The Tribonacci word is formed by repeated concatenation in the same way that… Read More »

Given a number n then print n terms of fibonacci series in reverse order. Examples: Input : n = 5 Output : 3 2 1… Read More »

Given a number n, find n-th Fibonacci Number. Note that F0 = 0, F1 = 1, F2 = 2, ….. Examples : Input : n… Read More »

“Fibonacci Series”, sounds familiar, right? An Easy To Understand sequence represented as 0 1 1 2 3 5 8 13…. where each number is the… Read More »

Given the value of n(n < 10), i.e, number of lines, print the Fibonacci triangle. Examples: Input : n = 5 Output : 1 1… Read More »

Given the upper limit limit, print factorials of all Fibonacci Numbers smaller than limit. Examples : Input : limit = 20 Output : 1 1… Read More »

Fibonomial Coefficient In mathematics, the Fibonomial coefficients or Fibonacci-binomial coefficients are defined as where n and k are non-negative integers, 0 ≤ k ≤ n,… Read More »

Fibonacci series = 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …….. Different methods to find nth Fibonacci number are already discussed. Another… Read More »

The Fibonnaci triangle or Hosoya’s triangle is a triangular arrangement of numbers based on Fibonacci numbers. Each number is the sum of two numbers above… Read More »

Like Fibonacci numbers, a Fibonacci word. is a specific sequence of binary digits (or symbols from any two-letter alphabet). The Fibonacci word is formed by… Read More »

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 »