More Problems

• Find the maximum number of tasks that can be completed before their respective deadlines from a given list of tasks with deadlines and durations.
• Given a list of items with weights and values, find the maximum value you can carry in a knapsack of a fixed capacity using a Greedy algorithm.
• You are given a list of meetings with start and end times. Find the minimum number of meeting rooms required to accommodate all meetings.
• Given an array of positive integers representing the distance between stones in a river, find the minimum number of jumps required to reach the last stone.
• You are given a list of tasks with deadlines and a profit for each task. Maximize the total profit by completing tasks before their respective deadlines.
• Given a set of people with weights, find the minimum number of elevator trips required to transport everyone without exceeding the weight limit of the elevator.
• You are given a list of intervals representing job durations. Find the minimum number of workers required to complete all jobs without overlapping.
• Given a grid of integers representing city blocks, where each integer represents the travel cost, find the minimum travel cost from the top-left corner to the bottom-right corner.