More Problems

• Given a set of items, each with a weight and a value, maximize the total value you can carry in a knapsack with a limited capacity.
• You are given a list of events with start and end times. Find the maximum number of non-overlapping events that can be attended.
• Given a list of tasks with start and end times and a number of workers, assign the tasks to the workers so that no worker has overlapping tasks, and the total number of completed tasks is maximized.
• You are given a grid where each cell represents a point on a 2D plane. Find the minimum path sum from the top-left to the bottom-right of the grid, moving only right or down.
• Given an array of integers, find the maximum possible sum of non-adjacent elements.
• You are given a set of items with weights and values. Maximize the total value that can be placed in a knapsack with a fixed weight capacity using a Greedy approach.
• Given an array of job deadlines and profits, maximize the total profit by scheduling the jobs optimally.
• You are given an array of integers. Partition the array into two subsets such that the difference between the sum of the subsets is minimized.