Event Conflict Resolver

Your task is to implement a function that takes a list of events and returns the maximum number of events you can attend without any overlaps.

Each event is represented as a pair of integers [start, end] where 0 ≤ start < end ≤ 1440 (the number of minutes in a day). Two events do not overlap if one event ends at or before the other begins. For example, if one event ends at time t and another starts at time t, they are not considered overlapping.

Requirements

• Implement a function, maxNonOverlappingEvents(events), where events is a list of pairs (or a list of lists) of integers.
• Your function should return an integer representing the maximum number of non-overlapping events you can attend.

Example

For events = [[60, 150], [160, 240], [120, 180], [200, 300]], one optimal selection is to attend the events [60, 150] and [160, 240] (or [200, 300]); the maximum number of events you can attend without conflicts is 2.

Notes

• Consider the efficiency of your solution, as the list of events might be large.
• Ensure your implementation correctly handles edge cases such as an empty list of events.

Write your solution in the programming language of your choice.