More Problems

• You are given an array of tasks with durations. Find the minimum total time required to complete all tasks using two workers.
• Given an array of integers, partition the array into two subsets such that the difference between the sum of elements in both subsets is minimized.
• You are given a set of items, each with a weight and a value. Maximize the total value that can be placed in a knapsack with a fixed capacity using the fractional knapsack approach.
• Find the minimum number of jumps required to reach the end of an array, where each element represents the maximum number of steps you can take.
• You are given a set of jobs, each with a start time, end time, and a profit. Maximize the total profit by scheduling the jobs optimally without overlaps.
• Given an array of positive integers representing stock prices, find the maximum profit that can be made by performing multiple buy-and-sell operations.
• You are given a set of events with start and end times. Maximize the number of non-overlapping events that can be attended.
• 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.