← All problemsSign in

3883. Count Non Decreasing Arrays With Given Digit Sums

LeetCodeArrayDynamic ProgrammingPrefix SumOpen on judge ↗

You are given an integer array digitSum of length n. An array arr of length n is considered valid if: - 0 <= arr[i] <= 5000 - it is non-decreasing. - the sum of the digits of arr[i] equals digitSum[i]. Return an integer denoting the number of distinct valid arrays. Since the answer may be large, return it modulo 109 + 7. An array is said to be non-decreasing if each element is greater than o

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