Chef and Subarray

CodeChefOpen on judge ↗

Chef wants to attend an event, but outside the event there is one security guard. If chef wants to attend that event, chef needs to solve the given problem by security guard. Security guard gave one array and $2$ numbers $L$ and $R$. Chef have to find the number of sub arrays which has sum of elements lying in the range of given two number($L$ and $R$) including both numbers. Chef needs your help

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