More Problems

• You are given a set of people with weights. Find the minimum number of groups that can be formed such that no group exceeds a weight limit.
• Given a list of job durations, assign the jobs to two machines such that the total time is minimized.
• You are given a set of items with weights and values. Find the subset of items that maximizes the value without exceeding a weight limit.
• Find the minimum number of segments required to cover a given line segment from point A to point B.
• Given a list of movies with their start and end times, find the maximum number of movies that can be watched.
• You are given a list of tasks with deadlines. Complete the tasks in the order that maximizes the number of completed tasks.
• Given a set of items with different values, select the subset of items that maximizes the total value within a given weight limit.
• Find the minimum number of swaps required to sort an array using the greedy approach.