## Given count of digits 1, 2, 3, 4, find the maximum sum possible

Given the count of digits 1, 2, 3, 4. Using these digits you are allowed to only form numbers 234 and 12. The task is… Read More »

## Replace all elements by difference of sums of positive and negative numbers after that element

Given an array of positive and negative elements. The task is to replace every i-th element of the array by the absolute difference of absolute… Read More »

## Optimal File Merge Patterns

Given n number of sorted files, the task is to find the minimum computations done to reach Optimal Merge Pattern. When two or more sorted… Read More »

## Maximize the value of the given expression

Given three non-zero integers a, b and c. The task is to find the maximum value possible by putting addition and multiplication signs between them… Read More »

## Minimum cuts required to convert a palindromic string to a different palindromic string

Given palindromic string s, the task is to find minimum k, such that you can cut this string into k+1 parts, and then unite them… Read More »

## Minimum changes required such that the string satisfies the given condition

Given a binary string str. In a single operation, we can change any ‘1’ to ‘0’ or any ‘0’ to ‘1’. The task is to… Read More »

## Count of pairs from 1 to a and 1 to b whose sum is divisible by N

Given three integers a, b and N. Find the total number of distinct pairs which can be formed by selecting one integer from 1 to… Read More »

## Generate array with minimum sum which can be deleted in P steps

Given two numbers N and P. The task is to generate an array of all positive elements, and in one operation you can choose a… Read More »

## Encrypt a string by repeating i-th character i times

Given a string str, the task is to encrypt the string with the given encryption algorithm. The 1st character of the string will be repeated… Read More »

## Find smallest number K such that K % p = 0 and q % K = 0

Given two integers p and q, the task is to find the smallest number K such that K % p = 0 and q %… Read More »

## Minimum LCM and GCD possible among all possible sub-arrays

Given an array arr[] of N positive integers, the task is to find the minimum LCM and GCD between elements of all possible sub-array. Examples:… Read More »

## Minimum operations to make frequency of all characters equal K

Given a string S of length N. The task is to find the minimum number of steps required on strings, so that it has exactly… Read More »

## Count possible moves in the given direction in a grid

Given a grid N x M size and initial position (X, Y) and a series of K moves. Each move contains 2 integers Dx and… Read More »

## Select numbers in such way to maximize the amount of money

Given two arrays A1 and A2 of N numbers. There are two people A and B who select numbers out of N. If A selects… Read More »

## Minimum number of elements that should be removed to make the array good

Given an array arr[], the task is to find the minimum number of elements that must be removed to make the array good. A sequence… Read More »