Java Optimized O(skills*(2^skills)) + O(skills^2) Bitmask dp matrix traversal
The optimization of removing people whose skills are a subset of some other person and removal of duplicate skill sets makes the size of people array O(len(req_
The optimization of removing people whose skills are a subset of some other person and removal of duplicate skill sets makes the size of people array O(len(req_skills))\n<iframe src="https://leetcode.com/playground/aQ9QGxLY/shared" frameBorder="0" width="1000" height="1000"></iframe>
['Memoization', 'Bitmask', 'Java']