More Problems

• You are given a set of items, each with a weight and value. Maximize the total value that can be carried in a knapsack with a fixed capacity using the Greedy algorithm.
• Find the minimum number of jumps required to reach the last index of an array, where each element represents the maximum number of steps you can take.
• You are given a list of people with different weights and an elevator with a weight limit. Find the minimum number of elevator trips required to transport everyone without exceeding the weight limit.
• 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 list of tasks with start and end times. Assign the tasks to workers such that the total number of completed tasks is maximized.
• You are given a grid of integers where each cell represents a travel cost. Find the minimum cost to travel from the top-left corner to the bottom-right corner of the grid.
• 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 set of jobs with deadlines and completion times. Maximize the number of jobs that can be completed before their deadlines.