Leetcode | K5kC | Code & More

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

Maximum Difference Between Adjacent Elements in a Circular Array

Maximum Difference Between Even and Odd Frequency II

Maximum Difference Between Even and Odd Frequency I