# Maximum Sum Obtained Of Any Permutation: Walkthrough

Maximum Sum Obtained Of Any Permutation shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Permute nums, then add nums[start]..nums[end] over requests. Count how often each index is requested with a difference array, sort those frequencies against nums, and take the dot product modulo 1e9+7.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n log n + q).

## Common mistake

Assigning large numbers to rarely requested indices.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at learn more.