## Minimum element left from the array after performing given operations

Given an array arr[] of N integers, the task is to remove the elements from both the ends of the array i.e. in a single… 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
- Minimum number of pairs required to make two strings same
- 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
- Minimum number of given operations required to reduce the array to 0 element
- 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
- Minimizing array sum by applying XOR operation on all elements of the array
- Smallest multiple of N formed using the given set of digits
- Maximize the size of array by deleting exactly k sub-arrays to make array prime
- 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 the minimum of maximum length of a jump required to reach the last island in exactly k jumps
- Find if a binary matrix exists with given row and column sums

Given an array arr[] of N integers, the task is to remove the elements from both the ends of the array i.e. in a single… Read More »

Given an array arr[] of N elements. The task is to find the count of positive integers that divide all the array elements. Examples: Input:… Read More »

Given a string. The task is to find the maximum number P, such that given string can be partitioned into P contiguous substrings such that… Read More »

Given an integer array, consisting of positive weights “W” and there values “V” respectively as a pair and some queries consisting of an integer ‘C’… Read More »

Given a number N, find the minimum possible sum of digits that can be obtained from a positive Multiple of N. Constraints : 1<=N<=10^5. Examples:… Read More »

Given an array arr of size N and a number K. The task is to find the minimum elements to be replaced in the array… Read More »

Given a number N. The task is to find the minimum number of binary strings required to represent the given number as the sum of… Read More »

There is one meeting room in a firm. There are N meetings in the form of (S[i], F[i]) where S[i] is the start time of… Read More »

Given two arrays X and L of same size N. Xi represents the position in an infinite line. Li represents the range up to which… Read More »

Given a string s of size N. The task is to find the largest substring which consists of same characters Examples: Input : s =… Read More »

Given a balanced parenthesis string which consists of ‘(‘ and ‘)‘. The task is to find the number of balanced parenthesis substrings in the given… Read More »

Given a number N. The task is to find the number of ways you can draw N chords in a circle with 2*N points such… Read More »

Given an array arr[] of N non-negative integers. The task is to find the length of the longest sub-array such that XOR of all the… Read More »

Given an array arr[] of N elements, the task is to find the length of the smallest sub-array which has sequence {0, 1, 2, 3,… Read More »

Given an array of pairs of numbers of size N. In every pair, the first number is always smaller than the second number. A pair… Read More »