# Find The Substring With Maximum Cost: Walkthrough

Find The Substring With Maximum Cost shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Each letter has a value from values[0..25]; the cost of a substring is the sum of those values. This is maximum-subarray (Kadane) on the mapped array; empty is allowed and scores 0, so never return a negative.

## 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).

## Common mistake

Forcing a non-empty substring even when every mapped value is negative, or summing the whole string.

## 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 real-time AI interview assistant for live interviews.