## Count possible ways to construct buildings

Given an input number of sections and each section has 2 plots on either sides of the road. Find all possible ways to construct buildings… 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
- Remove all Fibonacci Nodes from a Circular Singly Linked List
- C Program to print Fibonacci Series without using loop
- 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
- Find the numbers present at Kth level of a Fibonacci Binary Tree
- Split a Numeric String into Fibonacci Sequence
- Prime Fibonnaci | TCS Mockvita 2020
- 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
- Check whether Array represents a Fibonacci Series or not
- Check if a number is Full Fibonacci or not
- Count of numbers whose difference with Fibonacci count upto them is atleast K
- Array range queries to find the maximum Fibonacci number with updates
- Find two Fibonacci numbers whose sum can be represented as N
- 3 Different ways to print Fibonacci series in Java
- Count of Fibonacci pairs with sum N in range 0 to N

Given an input number of sections and each section has 2 plots on either sides of the road. Find all possible ways to construct buildings… Read More »

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:… Read More »

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 =… Read More »

Following is simple program to print first n Fibonacci numbers. Examples : Input : n = 3 Output : 1 1 2 Input : n… Read More »

We have discussed different methods to find nth Fibonacci Number. Following is another mathematically correct way to find the same. nth Fibonacci Number : Here… Read More »

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,… Read More »

Dynamic Programming is an algorithmic paradigm that solves a given complex problem by breaking it into subproblems and stores the results of subproblems to avoid… Read More »

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 »

In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation Fn = Fn-1 + Fn-2 with seed values F0 =… Read More »