## Minimum cost to buy N kilograms of sweet for M persons

Given an array of n size contains the cost of sweets in such a way that that sweet[i] is the cost of i sweets. The… 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 an array of n size contains the cost of sweets in such a way that that sweet[i] is the cost of i sweets. The… Read More »

Given a matrix, the task is to find the cost of the minimum path which is odd to reach the bottom of a matrix. If… Read More »

Given an array A having N elements and two integers L and R where, and . You can choose any element of the array (let’s… Read More »

Given a two-dimensional matrix, in how way can someone traverse it from top-left to bottom-right? Condition- At any particular cell the possible moves are either… Read More »

Given a sequence of matrices, find the most efficient way to multiply these matrices together. The problem is not actually to perform the multiplications, but… Read More »

Given a number N and a sum S, find the count of numbers upto N that have digit sum equal to S. Examples: Input :… Read More »

Given two string S and Q. The task is to count the number of the common subsequence in S and T. Examples: Input : S… Read More »

Given a number N, we have to find the minimum number of palindromes required to express N as a sum of them. Examples: Input :… Read More »

Given a number N, we have to find the minimum number of palindromes required to express N as a sum of them. Examples: Input: N… Read More »

Round 1 (Online Coding and MCQs):- The test was held on HackerEarth and was of 90 minutes. It consisted of 3 Coding Problem (100 Marks)… Read More »

Given two numeric strings, A and B. A numeric string is a string that contains only digits [‘0’-‘9’]. The task is to make both the… Read More »

Prerequisite : Dynamic Programming | Set 8 (Matrix Chain Multiplication) Given a sequence of matrices, find the most efficient way to multiply these matrices together.… Read More »

You are given an array A of size N. Your task is to find the length of largest dividing sub sequence.A dividing sequence is a… Read More »

We have been given N balloons, each with a number of coins associated with it. On bursting a balloon i, the number of coins gained… Read More »

The level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure that can determine the ancestor of a… Read More »