[('John',5), ('Mary',4), ('Sherry',10), ('John',3),('Mary',3),......... ..] There are duplicate names in this list, and each name corresponds to the number of characters in their text messages. Given such a list and a specific number N, you are asked to return the top N most active users. I used a dict to count how many words each person said. Then it's sorted.

You are given two N-sided dice, P and Q, where each die has N integer values (not necessarily unique or standard). When rolled, each side is equally likely to appear. Given the values on each side of dice P and Q, determine: The number of outcomes where P's roll is greater than Q's roll (i.e., P wins). Follow up 1: The number of outcomes where Q wins. Follow up 2: The number of outcomes where both rolls are equal (tie). P and Q are always in non-decreasing sorted order.