# Number Of Ways To Rearrange Sticks With K Sticks Visible: Practice Notes

Number Of Ways To Rearrange Sticks With K Sticks Visible shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Place the shortest stick last: either it is the last (visible) via dp[n-1][k-1], or it hides behind one of n-1 others via (n-1)*dp[n-1][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(nk).

## Common mistake

Enumerating permutations directly.

## 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 https://www.linkjob.ai/.