Greedy | K5kC | Code & More

Maximize Profit from Task Assignment

Maximize Score After Pair Deletions

Find Time Required to Eliminate Bacterial Strains

Longest Subsequence Repeated k Times

Minimum Deletions to Make String K-Special

Partition Array Such That Maximum Difference Is K

Divide Array Into Arrays With Max Difference

Max Difference You Can Get From Changing an Integer

Maximum Difference by Remapping a Digit

Using a Robot to Print the Lexicographically Smallest String