Minimize Max Diff (CS Academy Problem)
Difference between en1 and en2, changed 8 character(s)
How to solve this problem using binary search.<br>↵
Problem Statement :<br>↵
You are given an array A of N integers in nondecreasing order. Remove K integers such that the maximum difference between two consecutive elements is minimized.<br>↵
​​[Problem Link](https://csacademy.com/contest/round-34/task/minimize-max-diff/)  ↵
[solution using binary search](https://pastebin.com/zc8gua2V)↵
(I am not getting its intuition).↵
​​↵

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English I_love_penny 2017-06-22 08:37:34 8 Tiny change: 'ry search.\nProblem ' -> 'ry search.<br>\nProblem '
en1 English I_love_penny 2017-06-22 08:11:42 459 Initial revision (published)