## Sum of Fibonacci numbers at even indexes upto N terms

Given a positive integer N, the task is to find the value of F2 + F4 + F6 +………+ F2n upto N terms where Fi… Read More »

## K- Fibonacci series

Given integers ‘K’ and ‘N’, the task is to find the Nth term of the K-Fibonacci series. In K – Fibonacci series, the first ‘K’… Read More »

## Find the probability of a state at a given time in a Markov chain | Set 1

Given a Markov chain G, we have the find the probability of reaching the state F at time t = T if we start from… Read More »

## Minimum sum possible of any bracket sequence of length N

Given a number N representing the length of a bracket sequence consisting of brackets ‘(‘, ‘)’. The actual sequence is not known beforehand. Given the… Read More »

## Calculate Stirling numbers which represents the number of ways to arrange r objects around n different circles

S(r, n), represents the number of ways that we can arrange r objects around indistinguishable circles of length n, and every circle n must have… Read More »

## Gould’s Sequence

Given a positive Integer n, The task is to print Gould’s sequence up to nth term. In Mathematics, Gould’s sequence is an integer sequence whose… Read More »

## Minimum sum falling path in a NxN grid

Given an square array A of integers of size NxN. The task is to find the minimum sum of a falling path through A. A… Read More »

## Find the maximum sum of Plus shape pattern in a 2-D array

Given a 2-D array of size N*M where, . The task is to find the maximum value achievable by a + shaped pattern. The elements… Read More »

## Jump Pointer Algorithm

The Jump pointer algorithm is a design technique for parallel algorithms that operate on pointer structures, such as arrays or linked list. This algorithm is… Read More »

## Minimize the total number of teddies to be distributed

Given N number of students sitting in a line and each of them is having marks they got scored in the exam. The task is… Read More »

## Understanding The Coin Change Problem With Dynamic Programming

The Coin Change Problem is considered by many to be essential to understanding the paradigm of programming known as Dynamic Programming. The two often are… Read More »

## Total number of different staircase that can made from N boxes

Given N boxes each of unit dimension i.e. (1×1 ). The task is to find the total number of different staircases that can be made… Read More »

## Lexicographically largest prime path from top-left to bottom-right in a matrix

Given a m x n matrix of positive integers. The task is to find the number of paths from the top left of the matrix… Read More »

## Ways to write N as sum of two or more positive integers | Set-2

Given a number N, the task is to find the number of ways N can be partitioned, i.e. the number of ways that N can… Read More »

## Minimum number of increasing subsequences

Given an array of integers of size N, you have to divide it into the minimum number of “strictly increasing subsequences” For example: let the… Read More »