## Minimum number of Fibonacci jumps to reach end

Given an array of 0s and 1s, If any particular index i has value 1 then it is a safe index and if the value… Read More »

- Optimal Strategy for a Game | Set 2
- Samsung Interview Experience through Co-cubes (2019)
- Maximum sum such that no two elements are adjacent | Set 2
- Bellman Ford Algorithm (Simple Implementation)
- Longest subsequence such that adjacent elements have at least one common digit
- Coin Change | BFS Approach
- Minimum time required to rot all oranges | Dynamic Programming
- Partition an array of non-negative integers into two subsets such that average of both the subsets is equal
- Longest path in a directed Acyclic graph | Dynamic Programming
- Number of subsets with zero sum
- Count of integers of length N and value less than K such that they contain digits only from the given set
- Minimum number of cubes whose sum equals to given number N
- Maximum sum combination from two arrays
- LCA in a tree using Binary Lifting Technique
- Minimum cost to reach end of array array when a maximum jump of K index is allowed
- Maximum Sum Subsequence of length k
- Count number of ways to reach a given score in a Matrix
- Maximize the happiness of the groups on the Trip
- Maximum sum path in a matrix from top to bottom and back
- Flip minimum signs of array elements to get minimum sum of positive elements possible
- Distinct palindromic sub-strings of the given string using Dynamic Programming
- Greedy approach vs Dynamic programming
- Find the number of binary strings of length N with at least 3 consecutive 1s
- Iterative approach to print all permutations of an Array
- Maximum subarray sum by flipping signs of at most K array elements
- Divide the array in K segments such that the sum of minimums is maximized
- Count pairs of non-overlapping palindromic sub-strings of the given string
- Minimum steps to delete a string by deleting substring comprising of same characters
- Number of ways to choose elements from the array such that their average is K
- Number of shortest paths to reach every cell from bottom-left cell in the grid

Given an array of 0s and 1s, If any particular index i has value 1 then it is a safe index and if the value… Read More »

Given N pairs of numbers. The task is to count ways to choose exactly one number from each pair such that the sum of those… Read More »

Given two number N and M. The task is to find the number of shortest paths to reach the cell(i, j) in the grid of… Read More »

Given an integer array, consisting of positive weights “W” and there values “V” respectively as a pair and some queries consisting of an integer ‘C’… Read More »

Given an array, find the number of subsequences whose sum is even and the number of subsequences whose sum is odd. Example : Input: arr[]… Read More »

Given an array a of size N. The task is to find a subsequence X of length K such that gcd(X[0], X[1]) + (X[2], X[3])… Read More »

Given a string str containing lowercase English characters, we can perform the following two operations on the given string: Remove the entire string. Remove a… Read More »

Given two arrays arr1[] and arr2[] each of size N. The task is to choose some elements from both the arrays such that no two… Read More »

Given an array arr[] and two integers X and K. The task is to perform the following operation on array K times: Sort the array.… Read More »

Given a tree with N nodes and N-1 edges with root at 1 and given an array of N-1 integers. The task is to assign… Read More »

Given an array a of size N and an integer K, the task is to divide the array into K segments such that sum of… Read More »

Given an array of size N and an integer K. The task is to partition the array in K segments such that bitwise AND of… Read More »

Given a sorted array of N integers. The task is to find the longest subsequence such that every element in the subsequence is reachable by… Read More »

Given an array of size N. The task is to partition the given array into two subsets such that the average of all the elements… Read More »

The standard Tower of Hanoi problem is explained here . In the standard problem, all the disc transactions are considered identical. Given a 3×3 matrix… Read More »