Given a number N, the task is to find Nth Fibonacci number. The Fibonacci numbers are the numbers in the following integer series. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ……. In this series, each number is the sum of the two preceding ones starting from 0 and 1. Examples: Input :… Read More »
Dynamic Programming is an algorithmic approach to solve some complex problems easily and save time and number of comparisons by storing the results of past computations. The basic idea of dynamic programming is to store the results of previous calculation and reuse it in future instead of recalculating them. Consider a simple example of calculating Factorials from 1… Read More »
Given a Rooted Tree with n node, labeled from 1 to n and tree is rooted at node 1. Parent of i-th node is p[i], i is starting from 2 as 1 is always root node. Let f(L) denotes the smallest connected subgraph that contains all leaves L. The task is to count the number of ways to… Read More »
Given an array of unique integers, print the array in such a way that the first element is first maximum and second element is first minimum and so on. We have to Rearrange an array in maximum minimum form using Two Pointer Technique. Examples: Input : arr[] = {7, 1, 2, 3, 4, 5, 6} Output : 7… Read More »
Given an array of N integers, where each value represents the volume of the cloud. The task is to choose the two highest volume clouds from an array and smash them together. When two clouds smash then the clouds get condense into water and it rains. If the two highest volume cloud is not equal then the volume… Read More »
Given two array A[] and B[] of length N, the task is the find the minimum cost to make array A[] a permutation of array B[], where the cost of incrementing or decrementing an element by 1 is 1. Note: You are allowed to increase or decrease only 1 element of A at a time. Examples: Input :… Read More »
N objects are placed on X-axis, and coordinates are given. Starting your journey with coordinate 0, find minimum distance you need to travel to collect K objects (If multiple objects are placed on same position, you may collect some or all of them). Examples: Input: arr[] = {10, -10, -30, 20, 50}, K = 3 Output: 40 Explanation:… Read More »
Given an array of positive integers, find the maximum product difference. The product difference between the two pairs is defined as taking the product of two pairs, followed by taking their difference. We have to maximize the product difference. Examples: Input: arr[] = {1, 4, 3, 6, 7, 0} Output: 39 Input: arr[] = {1, 3, 4, 2,… Read More »
You are given an binary array (i.e., containing 0 and 1 as a element). Here, 0 means a straight path and 1 means zigzag path. Add one to score when zero appears otherwise do nothing. Find the contiguous maximum score that you can achieve from binary array. Calculate all ways of unique arrangement that you can achieve same… Read More »
Given an array of N size denotes number of students and element of array denotes marks of students. Marks belongs between 1 to 100, where A[i] is less or equal to 32 denotes that student was fail and A[i] grater or equal to 91 denotes it was passed with hons. The task is to find minimum number of… Read More »
