More Problems

• You are given an array of integers representing tasks, where each element is the time taken to complete the task. Assign the tasks to two processors such that the total time to complete all tasks is minimized.
• Given a list of people with weights and a boat with a maximum capacity, find the minimum number of boat trips required to transport all people safely across a river.
• You are given a set of jobs with deadlines and profits. Maximize the total profit by scheduling the jobs without any overlaps, ensuring no two jobs overlap.
• Find the maximum number of tasks that can be completed before their respective deadlines from a given list of tasks with deadlines and durations.
• Given a list of items with weights and values, find the maximum value you can carry in a knapsack of a fixed capacity using a Greedy algorithm.
• You are given a list of meetings with start and end times. Find the minimum number of meeting rooms required to accommodate all meetings.
• Given an array of positive integers representing the distance between stones in a river, find the minimum number of jumps required to reach the last stone.
• You are given a list of tasks with deadlines and a profit for each task. Maximize the total profit by completing tasks before their respective deadlines.