CodingHard
Maximum sweetness of sweets within time constraints
Filed under Infoedge
The question
Given vectors A (time to make sweet i), B (sweetness of sweet i), and C (available prep time), find the maximum total sweetness level achievable satisfying all constraints.
No write-up yet. Related questions below have one.
Related Infoedge questions
Collected from public candidate posts and coding forums. Updated Nov 2026.