# Find The K Beauty Of A Number: Interview Notes

Find The K Beauty Of A Number shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

The k-beauty of num is how many of its contiguous k-digit substrings (as integers, no leading-zero issues beyond the substring itself) divide num evenly and are non-zero. Slide a window of length k over the decimal string.

## 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(d) for d digits.

## Common mistake

Allowing a 0 divisor (crash) or parsing the whole number's permutations instead of contiguous substrings.

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