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

## Minimum odd cost path in a matrix

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 »

## Find maximum points which can be obtained by deleting elements from array

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 »

## Count the number of ways to traverse a Matrix

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 »

## Matrix Chain Multiplication (A O(N^2) Solution)

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 »

## Count numbers (smaller than or equal to N) with given digit sum

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 »

## Count common subsequence in two strings

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 »

## Minimum number of palindromes required to express N as a sum | Set 2

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 »

## Minimum number of palindromes required to express N as a sum | Set 1

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 »

## Walmart Labs Interview Experience ( On Campus FT + 6 month Internship )

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 »

## Minimum Cost to make two Numeric Strings Identical

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 »

## Printing Matrix Chain Multiplication (A Space Optimized Solution)

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 »

## Longest dividing subsequence

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 »

## Burst Balloon to maximize coins

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 »

## Level Ancestor Problem

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 »