More Problems

• Find the minimum number of fuel stops required to reach a destination using a vehicle with limited fuel capacity.
• You are given a set of items with a weight and value. Maximize the total value that can be carried in a knapsack with a fixed capacity using the fractional knapsack approach.
• You are given a list of jobs with deadlines and profits. Maximize the total profit by scheduling the jobs optimally without missing deadlines.
• You are given a list of tasks with deadlines and durations. Maximize the number of tasks that can be completed before their deadlines.
• You are given a grid where each cell represents a cost to travel through it. Find the minimum cost path from the top-left to the bottom-right corner, moving only right or down.
• You are given an array of integers representing tasks with durations. Assign the tasks to two processors such that the total time to complete all tasks is minimized.
• 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 all people without exceeding the weight limit.
• You are given a list of jobs with deadlines and profits. Maximize the total profit by scheduling non-overlapping jobs optimally.