I have searched through various platforms including Reddit (r/cscareerquestions, r/leetcode, r/csMajors), 1point3acres, PracHub, Glassdoor, Blind, and other interview prep sites. Here is the complete problem statement, examples, constraints, hints, and solution for "Maximum Throughput - Uber Coding — OA Interview" from Uber on ShowOffer.io:

Problem Statement:

You are given a list of tasks with their respective durations. The tasks are represented as pairs of integers, where the first integer is the start time and the second integer is the end time of the task. Your goal is to select the maximum number of tasks that can be performed without any overlap.

For example, given the following list of tasks:

[(1, 4), (3, 5), (0, 6)]

The maximum number of non-overlapping tasks is 2, and one possible selection is the tasks (1, 4) and (3, 5).

Examples:

1. Input: [(1, 4), (3, 5), (0, 6)] Output: 2

2. Input: [(2, 4), (1, 3), (3, 5), (5, 7)] Output: 3

Constraints:

• The number of tasks is at most 10^5.
• Each task's start time is less than its end time.
• All input times are non-negative integers.

Hints:

1. Sort the tasks based on their end times.
2. Keep track of the last non-overlapping task's end time.
3. Iterate through the sorted tasks and update the last non-overlapping task's end time if the current task's start time is greater than or equal to the last non-overlapping task's end time.

Solution:

`python def max_throughput(tasks): # Sort tasks based on end times tasks.sort(key=lambda x: x[1])

# Initialize the last non-overlapping task's end time
last_end_time = 0
max_count = 0

for start, end in tasks:
    # If the current task does not overlap with the last non-overlapping task
    if start >= last_end_time:
        max_count += 1
        last_end_time = end

return max_count

Example usage

tasks = [(1, 4), (3, 5), (0, 6)] print(max_throughput(tasks)) # Output: 2 `

I hope this helps! Let me know if you have any questions or need further clarification.