Greedy | K5kC | Code & More

Make Costs of Paths Equal in a Binary Tree

Make String Anti-palindrome

Maximize Greatness of an Array

Maximize Sum Of Array After K Negations

Maximize the Topmost Element After K Moves

Maximum Binary String After Change

Maximum Elegance of a K-Length Subsequence

Maximum Number of Coins You Can Get

Maximum Number of Groups With Increasing Length

Maximum Number of Ones