### PROBLEM LINK:

**Author:** Learner Club

### DIFFICULTY:

EASY

### PREREQUISITES:

### PROBLEM:

In short, problem was to find the maximum number of guests who can arrive at the same time.

### EXPLANATION:

**Method 1 O(n*log(n))**Sort the arrival times using any n*log(n) sorting algorithm then find most frequent one just by traversing list in O(n) time. To sort arrival time you can use pair in utility and sort function in algorithm of C++ STL or you can also use c qsort function with appropriate compare function or you can also convert time in minutes and sort normally.

**Method 2
O(n)**