Leetcode Problem 1434. Number of Ways to Wear Different Hats to Each Other

1434. Number of Ways to Wear Different Hats to Each Other

Leetcode Solutions

Initialize variables n, done, MOD, memo, and hatsToPeople.
Populate hatsToPeople with the preferences of each person.
Define the recursive function dp(hat, mask).
- If mask == done, return 1.
- If hat > 40, return 0.
- If memo[hat][mask] is calculated, return its value.
- Otherwise, calculate the number of ways by skipping the current hat and by placing the current hat on each person that prefers it and doesn't have a hat yet.
Use memoization to store the results of dp(hat, mask).
Return dp(1, 0) as the final answer.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen