← All problemsSign in

MINIMUM SIZE OF PLANETS

Chefu is an astronomer who observes planets every night. In a particular solar system, there are $N$ planets arranged in a row. Chefu is interested to note the planet with the smallest diameter, but he can only observe $K$ contiguous planets at a time due to its small telescope. So each day, he starts from the $i_{th}$ planet (initially $i$ is the first planet) and observes the next $K−1$ planets.

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

Sign in to chat with the tutor and save your progress.

Sign in to start