Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Maximize the sum of sum of the Array by removing end elements
- Maximize sum by selecting M elements from the start or end of rows of a Matrix
- Remove array end element to maximize the sum of product
- Maximize product of array by replacing array elements with its sum or product with element from another array
- Maximize the sum of X+Y elements by picking X and Y elements from 1st and 2nd array
- Maximize sum of K elements in Array by taking only corner elements
- Maximize sum of atmost K elements in array by taking only corner elements | Set 2
- Split an Array to maximize subarrays having equal count of odd and even elements for a cost not exceeding K
- Maximize count of distinct elements possible in an Array from the given operation
- Minimize count of array elements to be removed to maximize difference between any pair up to K
- Minimize swaps required to maximize the count of elements replacing a greater element in an Array
- Maximize count of array elements required to obtain given sum
- Minimize cost of choosing and skipping array elements to reach end of the given array
- Maximize the median of the given array after adding K elements to the same array
- Maximize Array sum by swapping at most K elements with another array
- Rearrange Array to maximize number having Array elements as digits based on given conditions
- Maximize sum of array by reducing array elements to contain no triplets (i, j, k) where a[i] < a[j] and a[i] < a[k] and j <i < k
- Maximize sum of given array by rearranging array such that the difference between adjacent elements is atmost 1
- Maximize count of pairs (i, j) from two arrays having element from first array not exceeding that from second array
- Maximize the sum of differences of consecutive elements after removing exactly K elements
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.