More Problems

• You are given a list of meetings with start and end times. Maximize the number of non-overlapping meetings that can be scheduled.
• You are given a list of tasks with deadlines and profits. Maximize the total profit by scheduling tasks optimally without any overlaps.
• You are given a set of intervals representing jobs with start and end times. Maximize the number of non-overlapping jobs 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 a Greedy approach.
• You are given a set of jobs with deadlines and profits. Maximize the total profit by scheduling non-overlapping jobs optimally.
• You are given an array of integers representing tasks with durations. Assign the tasks to two workers such that the total time to complete all tasks is minimized.
• You are given a list of events with start and end times. Maximize the number of non-overlapping events that can be attended.
• You are given a grid where each cell has a travel cost. Find the minimum cost path from the top-left corner to the bottom-right corner of the grid, moving only down or right.