MicrosoftCoding·90 minMembers
Count Non-Decreasing Arrays with Target Digit Sums
Members only
Second question of a 90-minute, two-question SDE II OA, with an AI hint available. Given requiredSum[i], count non-decreasing arrays where each result[i] is in [1, 5000] with digit sum requiredSum[i],...
SWE
dp
prefix-sum
combinatorics
hard
Frequency
Single report
Last asked
2026-10-03
Stage
oa
Log in to continue reading the full content
Comments
Sign in to join the discussion
Loading...
