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

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 »

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 »