Resource Scheduler

Your task is to implement a function that schedules events and returns the minimum number of resources required to handle all events without any overlap.

Description:

You are given a list of events, where each event is represented by an object with two properties: start and end (both are positive integers and start is less than end). If two events overlap in time, they cannot share the same resource. Your goal is to determine the minimum number of resources needed to schedule all events.

Requirements:

• Write a function or method that accepts an array (or list) of events and returns an integer representing the minimal number of resources required.

Input Format:

• An array (or list) of objects. Each object has two keys: start (integer) and end (integer).

Output Format:

• An integer that indicates the minimum number of resources required to schedule the events without any conflicts.

Example:

Suppose the input is:

[
  { "start": 30, "end": 75 },
  { "start": 0, "end": 50 },
  { "start": 60, "end": 150 }
]

The expected output is:

2

Constraints:

• Assume all start and end times are non-negative integers.
• If the event list is empty, return 0.
• Optimize for both time and space if possible.

Note:

• You are free to choose any programming language and data structures as needed. Make sure your solution covers edge cases, such as events that exactly touch each other.