Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
Given an array arr[] containing N elements, the task is to check if the sum of Fibonacci elements of the array is a fibonacci number… Read More »
Category Archives: Data Structures
GCD of elements occurring Fibonacci number of times in an Array
Given an array arr[] containing N elements, the task is to find the GCD of the elements which have frequency count which is a Fibonacci… Read More »
Count numbers divisible by K in a range with Fibonacci digit sum for Q queries
Given an array arr[][] containing Q queries and an integer K where each query consists of a range [L, R], the task is to find… Read More »
Count of nodes in a Binary Tree whose immediate children are co-prime
Given a Binary Tree, the task is to count the nodes whose immediate children are co-prime. Examples: Input: 1 / \ 15 5 / \… Read More »
Numbers with a Fibonacci difference between Sum of digits at even and odd positions in a given range
Prerequisites: Digit DP Given a range [L, R], the task is to count the numbers in this range having the difference between, the sum of… Read More »
Sum and product of K smallest and largest Fibonacci numbers in the array
Given an integer K and an array arr[] containing N integers, the task is to find the sum and product of K smallest and K… Read More »
Count of numbers whose difference with Fibonacci count upto them is atleast K
Prerequisites: Binary Search Given two positive integers N and K, the task is to count all the numbers that satisfy the following conditions: If the… Read More »
Maximize the number of indices such that element is greater than element to its left
Given an array arr[] of N integers, the task is to maximize the number of indices such that an element is greater than the element… Read More »
Digital Root of a given large integer using Recursion
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then… Read More »
Count of nodes in a Binary Tree whose child is its prime factors
Given a Binary Tree, the task is to print the count of nodes whose either of the immediate child is its prime factors. Examples: Input:… Read More »
String obtained by reversing and complementing a Binary string K times
Given a binary string of size N and an integer K, the task is to perform K operations upon the string and print the final… Read More »
Minimum increment or decrement required to sort the array | Top-down Approach
Given an array arr[] of N integers, the task is to sort the array in increasing order by performing minimum number of operations. In a… Read More »
Find sum of all Boundary and Diagonal element of a Matrix
Given a 2D array arr[][] of order NxN, the task is to find the sum of all the elements present in both the diagonals and… Read More »
Minimum steps required to make an array decreasing
Given an array arr[], the task is to find the minimum steps required to make an array decreasing, where in each step remove all elements… Read More »
Program to reverse the rows in a 2d Array
Given a 2D array arr[][] of size M x N integers where M is the number of rows and N is the number of columns.… Read More »
