# Find The Longest Awesome Substring: Study Guide

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

## Key idea

A substring can be rearranged into a palindrome if at most one digit has an odd count. Track a 10-bit parity mask of digit counts and the first index of each mask; a repeat or a one-bit-flip of a seen mask gives a candidate length.

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

## Common mistake

Requiring every digit even (a palindrome with no center).

## 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 official website.