More Problems

• You are given a list of activities with start and end times. Maximize the number of non-overlapping activities that can be scheduled.
• Find the minimum number of fuel stops required to reach a destination, where the vehicle has limited fuel capacity and fuel stations are placed at various points along the route.
• 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, ensuring that no bus exceeds a weight limit, and that all people are transported.
• 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 changes required to convert one string into another, where only replacements are allowed.
• You are given a list of tasks with deadlines and completion times. Maximize the number of tasks that can be completed before their deadlines.
• Find the minimum number of swaps required to sort an array using only adjacent swaps.