Skip to content

# Tag Archives: Fibonacci

Given an array arr[] consisting of N integers, the task is to minimize the cost of converting all array elements to a Fibonacci Number, where… Read More
Golden Ratio: Two numbers, say A and B are said to be in the golden ratio if their ratio equals the ratio of the sum… Read More
Given a positive integer N, the task is to find the nearest Fibonacci number to the given integer N. If there are two Fibonacci Numbers… Read More
Given a positive number N, the task is to find the sum of the first (N + 1) Fibonacci Numbers. Examples: Input: N = 3Output:… Read More
Given an array arr[], the task is to find the minimum number increments or decrements by 1 required to convert the array into a Fibonacci… Read More
Given three positive integers A, B, and N where A and B are the first two terms of the XOR Fibonacci series, the task is… Read More
Given an array arr[] of size N, the task is to find the composite Fibonacci numbers present in the given array. Examples: Input: arr[] =… Read More
Given a singly linked list containing N nodes, the task is to find the mean of all the distinct nodes from the list whose data… Read More
Given two integers N and M, generate a sequence of N binary strings by the following steps: S0 = “0” S1 = “1” Generate remaining… Read More
Given a number N, the task is to find the number of ways in which the integer N can be represented as a sum of… Read More
Given two integers X and Y, the task is to perform the following operations: Find all prime numbers in the range [X, Y]. Generate all… Read More
Given a numeric string S representing a large number, the task is to form a Fibonacci Sequence of at least length 3 from the given… Read More
Problem Description Given two numbers N1 and N2. Find prime numbers between N1 and N2, then Make all possible unique combinations of numbers from the… Read More
Given a number N, we need to find the Fibonacci Series up to the N term. The Fibonacci series is a series of elements where,… Read More
Given a number N, the task is to print Fibonacci Series till Nth number without using any loop. Examples: Input: N = 5 Output: 0… Read More