You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Good morning! Here's your coding interview problem for today.
This problem was asked by Microsoft.
You are given a list of jobs to be done, where each job is represented by a start time and end time. Two jobs are compatible if they don't overlap. Find the largest subset of compatible jobs.
For example, given the following jobs (there is no guarantee that jobs will be sorted):
Good morning! Here's your coding interview problem for today.
This problem was asked by Microsoft.
You are given a list of jobs to be done, where each job is represented by a start time and end time. Two jobs are compatible if they don't overlap. Find the largest subset of compatible jobs.
For example, given the following jobs (there is no guarantee that jobs will be sorted):
Return:
The text was updated successfully, but these errors were encountered: