Question
An access-control service stores each user's permissions as one integer bitmask. You are given the ordered list of permission names for a resource — the name at index i corresponds to bit i — and the list of names granted to a user (each granted name appears in the flag list; no duplicates). Return the bitmask encoding the grant. For example, with flags ["read", "write", "delete"] and granted ["read", "delete"], bits 0 and 2 are set, so return 5.
encode_permissions(flags: list[str], granted: list[str]) → int[["read","write","delete"],["read","delete"]]out5[["r","w","x","admin"],["admin","w"]]out10State 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.