Hackerrank Solution | ACM ICPC Team | Python

HackerRank Solution | ACM ICPC Team

ACEM ICPC Team Problem Statement

There are a number of people who will be attending ACM-ICPC World Finals. Each of them may be well versed in a number of topics. Given a list of topics known by each attendee, presented as binary strings, determine the maximum number of topics a 2-person team can know. Each subject has a column in the binary string, and a '1' means the subject is known while '0' means it is not. Also determine the number of teams that know the maximum number of topics. Return an integer array with two elements. The first is the maximum number of topics known, and the second is the number of teams that know that number of topics.

ACEM ICPC Team Solution Code

Note: These solutions are absolutely not the most optimized and effecient one. These are very beginner style approach and was solved without prior knowledge of CS concepts like DataStructures and Algorithms that are usually taught in colleges.

Python Code

Post a Comment