More Problems

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