Gift for Birthday

CodeChefOpen on judge ↗

You are given an array A of integers and two special integers 'd' and 'm' as input. A *Gift Sequence* is defined to be any continuous subsequence having length 'm' such that sum of the integers in this subsequence equals 'd'. Count the number of Gift Sequences present in the array A.

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