More Problems

• You are given a list of tasks with start and end times. Assign the tasks to multiple workers such that the maximum number of tasks are completed without overlap.
• You are given an array of integers representing stock prices where each element is the price of the stock on that day. Find the maximum profit that can be made by buying and selling the stock at most once.
• You are given a set of jobs with deadlines and profits. Maximize the total profit by scheduling the jobs optimally without missing deadlines.
• You are given an array of tasks with start and end times. Assign the tasks to two processors such that the total completion time is minimized.
• You are given a list of events with start and end times. Find the maximum number of non-overlapping events that can be attended.
• You are given a set of jobs with start and end times. Maximize the number of non-overlapping jobs that can be completed.
• Given an array of integers representing steps you can take forward, find the minimum number of jumps required to reach the last index.
• You are given a set of events with start and end times. Maximize the number of non-overlapping events that can be attended.