More Problems

• Find the minimum number of platforms required to accommodate a set of trains arriving and departing at a station, ensuring no time overlaps.
• 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 set of jobs with deadlines and profits. Maximize the total profit by scheduling non-overlapping jobs optimally.
• You are given a list of jobs with deadlines and profits. Maximize the total profit by scheduling non-overlapping jobs optimally without missing deadlines.
• You are given a grid where each cell represents a travel cost. Find the minimum cost to travel from the top-left corner to the bottom-right corner, moving only right or down.
• You are given a set of jobs with deadlines and durations. Maximize the number of jobs 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 twice.
• You are given a set of jobs with start and end times. Maximize the number of non-overlapping jobs that can be scheduled.