Find number of different possible profits from N transactions
Filed under Aptean
The question
Given N transactions with a minimum profit value X and maximum profit value Y in a single transaction, find the number of different possible total profit values that can be made.
No write-up yet. Related questions below have one.
Related Aptean questions
Collected from public candidate posts and coding forums. Updated Nov 2026.