More Problems

• You are given a list of tasks with start and end times. Maximize the number of non-overlapping tasks that can be completed.
• Find the minimum number of buses required to transport all people, where each bus has a maximum weight limit and each person has a weight.
• You are given a list of intervals representing tasks. Maximize the number of non-overlapping tasks that can be scheduled.
• Find the minimum number of operations needed to make all elements in an array equal using only increment and decrement operations.
• You are given a list of activities with start and end times. Find the maximum number of non-overlapping activities that can be scheduled in one room.
• Find the minimum number of platforms required to accommodate a set of trains, where each train has an arrival and departure time.
• You are given a set of jobs with deadlines and profits. Maximize the profit by scheduling non-overlapping jobs.
• Find the minimum number of swaps required to sort an array in non-decreasing order using a greedy algorithm.