# Maximum Good People Based On Statements: Practice Notes

Maximum Good People Based On Statements shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

n people, statements[i][j] in {0,1,2} (bad, good, unknown). A person is good iff all of their statements are true; a bad person may say anything. n<=16: enumerate a bitmask of who is good, verify consistency with every statement from a good person (and that the mask's good-count matches), and take the maximum popcount that verifies.

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

## Common mistake

Trusting statements from people the mask marks bad, or forgetting that bad people can tell the truth or lie freely.

## 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 AI interview helper that uses your resume.