I was recently been asked this question in google onsite round (L5):\n\n```\nimagine you own Stackoverflow.com and your number of unanswered questions have grown\nsignificantly. Your employees volunteers to answer these questions. \nYou can assign question to a volunteer contingent upon below constrints:\n\n1. Each question can have one or more tags associated. each tag is a skill like python, data science, etc.\n    Question can be assigned to a volunteer only if a volunteer has atleast one skill from tags of thee\n\tquestion.\n\t\n2. Volunteer can also have one or more skills (where skills = tags)\n\nWrite a code to optimally assign this questions to volunteers so that \nyou can answer maximum questions.\n\n```\n\nI used heap to answer this question. but my implementation exploded time / space complexity. Looking for suggestions

I was recently been asked this question in google onsite round (L5):\n\n\nimagine you own Stackoverflow.com and your number of unanswered questions have grown\n