## 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 »

- Check if a word exists in a grid or not
- Minimum steps to reach any of the boundary edges of a matrix | Set 1
- Sum of XOR of all subarrays
- Count ways to reach a score using 1 and 2 with no consecutive 2s
- Make Binary Search Tree
- Treasure and Cities
- Number of ways to partition a string into two balanced subsequences
- Memoization using decorators in Python
- Color N boxes using M colors such that K boxes have different color from the box on its left
- Jump Pointer Algorithm
- Minimum distance to the end of a grid from source
- Minimum steps required to convert X to Y where a binary matrix represents the possible conversions
- Minimum cost to reach a point N from 0 with two different operations allowed
- A variation of Rat in a Maze : multiple steps or jumps allowed
- Count of Numbers in Range where first digit is equal to last digit of the number
- Count of sub-sets of size n with total element sum divisible by 3
- Minimum sum falling path in a NxN grid
- Count of Numbers in a Range divisible by m and having digit d in even positions
- Ways to place K bishops on an N×N chessboard so that no two attack
- Find sub-matrix with the given sum
- Number of Binary Strings of length N with K adjacent Set Bits
- Find the sum of first N odd Fibonacci numbers
- Minimum Operations to make value of all vertices of the tree Zero
- Number of balanced bracket expressions that can be formed from a string
- Minimum number of operations required to sum to binary string S
- Count of Numbers in a Range where digit d occurs exactly K times
- Count pairs (A, B) such that A has X and B has Y number of set bits and A+B = C
- Count the number of special permutations
- Count of Numbers in Range where the number does not contain more than K non zero digits
- Number of Paths of Weight W in a K-ary tree

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

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »