candies

CodeChefOpen on judge ↗

The chef has received a problem from his friend who is a chemist. He has got n candies. This all candies have some sucrose level. He has to eat such candy whose sucrose level is the difference of sucrose level of candy with maximum and minimum sucrose level. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of two l

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