More Problems

• You are given an array of integers representing tasks with durations. Assign the tasks to two processors such that the total time to complete all tasks is minimized.
• You are given a set of people with different weights and an elevator with a weight limit. Find the minimum number of elevator trips required to transport all people without exceeding the weight limit.
• You are given a list of jobs with deadlines and profits. Maximize the total profit by scheduling non-overlapping jobs optimally.
• Given a list of meetings with start and end times, find the minimum number of meeting rooms required to accommodate all meetings.
• You are given a set of events with start and end times. Maximize the number of non-overlapping events that can be attended.
• You are given a set of intervals representing tasks. Maximize the number of non-overlapping tasks that can be scheduled.
• You are given an array of integers representing tasks, where each element is the time taken to complete the task. Find the minimum total time required to complete all tasks using two workers.
• You are given a set of items with weights and values. Maximize the total value that can be carried in a knapsack with a fixed capacity using the Greedy approach.