Hackerrank – ACM ICPC Team

Hackerrank – Problem Statement

A description of the problem can be found on Hackerrank.


I will create all posible pairs of players. That means I will try to combine every possible combination of player pairs. The topics are given in binary way. I will use OR operation on binaries. It is enough that one of the players knows the topic.

I will find all teams (pairs) with most known topics and count them.

I created solution in:

All solutions are also available on my GitHub profile.




Leave a Reply

Your email address will not be published. Required fields are marked *