More Problems

• Find the maximum number of non-overlapping tasks that can be completed from a list of tasks with durations.
• You are given a list of jobs with deadlines and completion times. Find the schedule that minimizes the total time spent.
• Given a list of items with values and weights, find the maximum value you can carry without exceeding a weight limit using a greedy approach.
• Find the minimum number of containers required to store a set of items, where each item has a specific size.
• You are given a list of meetings with start and end times. Find the maximum number of non-overlapping meetings that can be scheduled in a single room.
• Find the minimum number of pages each student must read from a set of books, such that the workload is balanced.
• You are given a list of jobs with deadlines and profits. Maximize the profit by scheduling the jobs optimally.
• Find the minimum number of swaps required to sort an array in non-decreasing order using a greedy approach.