1 class Solution:
 2     def smallestSufficientTeam(self, req_skills: List[str], people: List[List[str]]) -> List[int]:
 3         n = len(req_skills)
 4         # Map skill name to its bit position
 5         skill_to_idx = {skill: i for i, skill in enumerate(req_skills)}
 6         target_mask = (1 << n) - 1
 7         
 8         # dp[mask] = list of indices of people who cover those skills
 9         # Initialize with the empty set for mask 0
10         dp = {0: []}
11         
12         for i, person_skills in enumerate(people):
13             # Convert current person's skills into a bitmask
14             current_person_mask = 0
15             for skill in person_skills:
16                 if skill in skill_to_idx:
17                     current_person_mask |= (1 << skill_to_idx[skill])
18             
19             # Try to combine this person with all skill sets we've found so far
20             # We iterate over a copy of keys to avoid "dictionary changed size during iteration"
21             for mask, team in list(dp.items()):
22                 new_mask = mask | current_person_mask
23                 
24                 # If we found a new skill combination OR a shorter way to get an existing one
25                 if new_mask not in dp or len(dp[new_mask]) > len(team) + 1:
26                     dp[new_mask] = team + [i]
27                     
28         return dp[target_mask]