# Number Of Music Playlists: Study Guide

Number Of Music Playlists shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DP[len][used] = ways to build a playlist of `len` songs using exactly `used` distinct songs. A new song contributes dp[i-1][used-1]*(N-used+1); a repeat (when used > K) contributes dp[i-1][used]*(used-K).

## 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(goal * n).

## Common mistake

Treating repeats as free without the "K other songs in between" rule, which overcounts illegal playlists.

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