More Problems

• Given a set of items, each with a weight and value, find the maximum value you can carry in a knapsack with a limited capacity using a Greedy algorithm.
• You are given an array of integers representing stock prices. Find the maximum profit you can make by buying and selling the stock at most twice.
• Given an array of positive integers where each element represents the number of steps you can take forward from that index, find the minimum number of jumps to reach the end of the array.
• You are given a set of jobs with deadlines and profits. Maximize the total profit by scheduling the jobs optimally, ensuring no overlaps between the jobs.
• Find the minimum number of platforms required to accommodate a set of trains arriving and departing at specific times.
• You are given a set of people with weights and a boat with a limited capacity. Find the minimum number of boat trips required to transport all people across the river safely.
• Given a list of tasks with start and end times, assign the tasks to workers such that the maximum number of tasks are completed without overlap.
• You are given a grid of city blocks, where each block has a different traversal cost. Find the minimum cost to travel from the top-left corner to the bottom-right corner.