Can you help me solving a coaching distribution problem?

Hey everyone!

Not sure this is the perfect place to ask, but I’ll give it a shot.

I work in sales/marketing (not a technical role), and I’m trying to solve a coaching optimization problem.

Here’s the situation:

I have a binary matrix: topics × people (63 topics in column A, 22 people in headers), where 1 = needs coaching, 0 = doesn’t.

What I want to do:

Create bundles of topics such that:

- I minimize the total number of coaching sessions

- Each session covers multiple topics (up to 5)

- The people attending each session have as many “1s” as possible for those topics (i.e., high overlap, so the session is relevant to them)

- Once a person is coached 1 becomes 0

In other words, I’m trying to group topics together so that each session targets a group of people who all need help with those same topics, while minimizing the sessions. In the end I need all 1s become 0.

Can you pls help me finding a solution.

P.S. unfortunately I have very limited resources at work due to my work position and strict policies, so the only tool I can use is Google Sheets in the browser (not even App Scripts). I’m currently testing greedy, but stuck, because I use AI and it’s imagining a lot of stuff.

Thx in advance!