Minimize the Heights II - 450DSA Cracker Solutio

Minimize the Heights II Given an array arr[] denoting heights of N towers and a positive integer K. For each tower, you must perform exactly one of the following operations exactly once. Increase the height of the tower by K Decrease the height of ...