Given an array of integers H representing heights of towers and a positive integer K.↵
It is allowed to either increase or decrease the height of every tower by B **(only once)**.↵
↵
How to calculate the minimum possible difference between the **heights of the longest** ↵
**and the shortest tower after modifications.**↵
↵
Note: **It is mandatory to either increase or decrease the height of every tower.**
It is allowed to either increase or decrease the height of every tower by B **(only once)**.↵
↵
How to calculate the minimum possible difference between the **heights of the longest** ↵
**and the shortest tower after modifications.**↵
↵
Note: **It is mandatory to either increase or decrease the height of every tower.**