More Problems

• You are given a list of jobs with start and end times. Maximize the number of non-overlapping jobs that can be scheduled.
• Given a set of coins with different denominations, find the minimum number of coins required to make a specific amount using the Greedy approach.
• You are given an array of integers representing tasks, where each element represents the time to complete the task. Find the minimum total time required to complete all tasks using two workers.
• Given a list of people with weights and a boat with a limited capacity, find the minimum number of boat trips required to transport all the people safely across the river.
• You are given a grid representing city blocks, where each cell has a cost to traverse. Find the minimum cost path from the top-left to the bottom-right corner of the grid.
• Given a list of tasks with deadlines and profits, maximize the total profit by scheduling tasks optimally without overlaps.
• You are given a list of jobs with deadlines and profits. Maximize the total profit by scheduling the jobs optimally, ensuring that no job deadlines are missed.
• Find the minimum number of platforms required at a railway station to accommodate a set of trains arriving and departing at different times.