# Total Appeal Of A String: Study Guide

Total Appeal Of A String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

The appeal of a string is its number of distinct characters; sum appeal over every substring. For each new character s[i], it adds (i - last[s[i]]) * (n - i) extra distinct-counts across substrings that newly include this occurrence.

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

Computing distinct counts inside every substring in O(n^2).

## 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 AI job interview answers in real time.