More Problems

• You are given a set of jobs with start and end times. Maximize the number of non-overlapping jobs that can be completed.
• You are given a list of tasks with deadlines and durations. Maximize the number of tasks that can be completed before their deadlines.
• You are given an array of stock prices where each element represents the price of the stock on that day. Find the maximum profit that can be made by buying and selling the stock at most once.
• 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 approach.
• 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 set of intervals representing jobs with start and end times. Maximize the number of non-overlapping jobs that can be completed.
• You are given a list of people with weights and a boat with a fixed capacity. Find the minimum number of boat trips required to transport all the people safely.
• You are given an array of integers representing the time required to complete a set of tasks. Assign the tasks to two processors such that the total time to complete all tasks is minimized.