More Problems

• 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 list of jobs with deadlines and profits. Maximize the total profit by scheduling non-overlapping jobs optimally without missing any deadlines.
• 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 algorithm.
• 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 durations. Maximize the number of jobs that can be completed before their deadlines.
• Find the minimum number of platforms required to accommodate all trains arriving and departing at a station, ensuring no time overlaps.
• You are given a grid of integers representing city blocks where each cell has a traversal cost. Find the minimum cost path from the top-left corner to the bottom-right corner of the grid.
• 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.