# Maximum Score Words Formed By Letters: Interview Notes

Maximum Score Words Formed By Letters shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Each word has a score and a letter-count vector. DFS over the 2^n word subsets, rejecting any subset that exceeds the available letter frequencies.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(2^n * L).

## Common mistake

Picking words greedily by score/length and running out of a critical letter.

## 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 interview assistant.