## Maximum number of teams that can be formed with given persons

Given two integers N and M which denote the number of persons of Type1 and Type2 respectively. The task is to find the maximum number… Read More »

- Split the given array into K sub-arrays such that maximum sum of all sub arrays is minimum
- Find maximum meetings in one room
- Greedy approach vs Dynamic programming
- Largest substring with same Characters
- Find minimum changes required in an array for it to contain k distinct elements
- Maximum Length Chain of Pairs | Set-2
- Unbounded Fractional Knapsack
- Check whether a subsequence exists with sum equal to k if arr[i]> 2*arr[i-1]
- Count of integers that divide all the elements of the given array
- Create a Sorted Array Using Binary Search
- Find minimum length sub-array which has given sub-sequence in it
- Count common elements in two arrays containing multiples of N and M
- Maximum distance between two unequal elements
- Maximum String Partition
- Minimum deletions required to make GCD of the array equal to 1
- Minimum operations required to make every element greater than or equal to K
- Number of balanced parenthesis substrings
- Find the Kth smallest element in the sorted generated array
- Minimum deletions required such that any number X will occur exactly X times
- Longest Subarray having strictly positive XOR
- Maximum possible sub-array sum after at most X swaps
- Count ways to divide circle using N non-intersecting chord | Set-2
- Fractional Knapsack Queries
- Find if a binary matrix exists with given row and column sums
- Minimum deletions required to make frequency of each letter unique
- Lexicographically smallest string of length N and sum K
- Length of longest sub-array with maximum arithmetic mean.
- Minimum increment operations to make K elements equal
- Find Nth smallest number that is divisible by 100 exactly K times
- Queries for number of distinct elements from a given index till last index in an array

Given two integers N and M which denote the number of persons of Type1 and Type2 respectively. The task is to find the maximum number… Read More »

Given an integer N. You can select any two digits from this number (the digits can be same but their positions should be different) and… Read More »

Given a string str of length n (n is a multiple of 3) containing characters only from the set {0, 1, 2}. The task is… Read More »

Given sides of four small squares. You have to find the side of the smallest square such that it can contain all given 4 squares… Read More »

Given an integer area, the task is to find the length and breadth of a rectangle with the given area such that the difference between… Read More »

Given an array arr[] and an integer K. The task is to find the size of the maximum sub-set such that every pair from the… Read More »

Given a string of consecutive digits and a number Y, the task is to find the number of minimum sets such that every set follows… Read More »

Given an array A[] of size N / 2, the task is to construct the array B[] of size N such that: B[] is sorted… Read More »

Given an integer X > 1 and an integer K > 0, the task is to find the greatest odd number < X such that… Read More »

Given two integers L and R, the task is to find the greatest divisor that divides all the natural numbers in the range [L, R].… Read More »

Given an array of 2 * n elements, the task is to construct and print an array of n element such that the mean of… Read More »

Given an array consisting of N positive integer numbers. The task is to remove exactly one element from this array to minimize max(a) – min(a)… Read More »

You have an unlimited number of 10-rupee coins and exactly one coin of r rupee and you need to buy minimum items each of cost… Read More »

Given an array arr[] of size n ≥ 3, the task is to find the minimum possible difference between the maximum and the minimum element… Read More »

Given an array of integers. The task is to find the minimum number of consecutive sequences that can be formed using the elements of the… Read More »