# Number Of Ways To Wear Different Hats To Each Other: Study Guide

Number Of Ways To Wear Different Hats To Each Other shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

At most 40 hats and 10 people. Prefer DP on hats: for each hat decide which still-hatless person (bitmask) wears it, or skip the hat. dp[mask] after all hats is the answer for the full-people mask. Mod 10^9+7.

## 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(h * 2^n * n).

## Common mistake

Assigning hats to people (40^10) instead of people to hats, which explodes, or allowing two people the same hat.

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