Leetcode | K5kC | Code & More

Sum of k-Mirror Numbers

Divide a String Into Groups of Size k

Minimum Deletions to Make String K-Special

Maximum Manhattan Distance After K Changes

Partition Array Such That Maximum Difference Is K

Divide Array Into Arrays With Max Difference

Count the Number of Arrays with K Matching Adjacent Elements

Maximum Difference Between Increasing Elements

Max Difference You Can Get From Changing an Integer

Maximum Difference by Remapping a Digit