Event Scheduling Conflicts

You work for a conference organizer and need to schedule talks in such a way that there are no overlaps in the schedule. Given a list of talks with start and end times, return the maximum number of talks that can be scheduled without any overlaps. Input Format: - The first line contains an integer N (the number of talks). - The next N lines each contain two integers start and end, representing the start and end times of the talk. Output Format: - Print a single integer: the maximum number of talks that can be scheduled. Example Input: 5 1 3 2 4 3 5 6 8 5 7 Example Output: 4