More Problems

• Find the maximum number of non-overlapping flights that can be taken, given a set of flights with start and end times.
• You are given a set of tasks with deadlines and durations. Minimize the total completion time for all tasks using a greedy algorithm.
• Given a list of intervals representing time slots for interviews, find the maximum number of non-overlapping interviews that can be scheduled.
• You are given a set of delivery tasks with start and end times. Maximize the number of deliveries you can complete without overlapping times.
• Find the minimum number of groups required to partition people into groups such that the difference in height within each group is minimized.
• You are given a set of projects with start and end times. Find the maximum number of non-overlapping projects that can be completed.
• Find the minimum number of platforms required for a railway station, given arrival and departure times of trains.
• You are given an array of houses, each containing money. Maximize the total amount you can rob without robbing two adjacent houses.