Minimize the Maximum Difference of Heights|Love Babbar DSA Cracker Sheet|Solved🔥

preview_player
Показать описание
In this video, I've demonstrated and shown how to approach this particular problem.
Рекомендации по теме
Комментарии
Автор

4:24 the question is telling you to Minimize the Maximum Difference of Heights which means find the highest and lowest value add or subtract between them and minimize the result .
and if you sorted the array the arr[o] is minimum and arr[n-1]is maximum just do + k and -k and return the result

techkid