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.
• You are given a set of items with weights and values. Maximize the total value that can be carried in a knapsack with a fixed capacity using the Greedy algorithm.
• You are given a set of people with different weights and an elevator with a weight limit. Find the minimum number of elevator trips required to transport everyone.
• You are given a list of jobs with deadlines and durations. Maximize the number of jobs that can be completed before their deadlines.
• You are given a set of tasks with deadlines and profits. Maximize the total profit by scheduling non-overlapping tasks optimally.
• You are given an array of integers representing tasks, where each element represents the time to complete the task. Assign the tasks to two processors to minimize the total completion time.
• Find the minimum number of platforms required to accommodate a set of trains arriving and departing at specific times.
• You are given a grid where each cell represents a travel cost. Find the minimum cost path from the top-left corner to the bottom-right corner, moving only down or right.