Question
Check submitted passwords against a known-breached set. Given a list of candidate `passwords` and a `breached_set` list of passwords known to be compromised, return a list of booleans (same length and order as `passwords`) where each entry is True if that password appears in the breached set and must be rejected. An empty password list returns an empty list.
check_breached(passwords: list[str], breached_set: list[str]) → list[bool][["abc","secure1","123456"],["123456","password","abc"]]out[true,false,true]State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.