← All problemsSign in

Chef and the Buckets

It is the festival of Holi and Chef and his friends are playing an interesting game. There are $N$ buckets numbered from $0$ to $N-1$, each of these buckets is initially empty. Now each of Chef’s friends will provide a total of $Q$ queries, where each query gives a range of buckets from $L$ to $R$ and a value $X$ which is the number of water balloons that must be added to each of these buckets fro

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