← All problemsSign in

Diabetes

You really love sweets and come across a sweet shop that has $N$ sweets in a row, and each of them has some cost(not necessarily the same). You have $M$ rupees and are looking to buy as many as you can. You can start at any sweet and start buying sweets linearly, that is, if you buy the $i$th sweet, the next sweet you buy has to be $(i+1)$th. You can only buy sweets as long as you can afford them

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