Maximize the minimium distance

CodeChefOpen on judge ↗

There are $N$ houses in the city Indore, situated at the positions $A_i$. $M$ Student of indore insitute of Science and Technology are decided to shift in these $N$ houses. They want to shift in such a way that the minimum distance between the house of any two friends is maximum. Note, If in case it is not possible to shift then print -1. ### Input - First line will contain $T$, number of testca

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI