More Problems

• You are given a list of items with weights and values. Maximize the total value of items that can be put into a knapsack with a fixed weight capacity using a greedy approach.
• Find the minimum number of steps required to make an array sorted in non-decreasing order using adjacent swaps.
• You are given a list of jobs with deadlines and profits. Maximize the total profit by scheduling non-overlapping jobs optimally.
• Given a set of intervals representing jobs, find the maximum number of non-overlapping jobs that can be completed.
• You are given a grid where each cell has a cost. Find the minimum cost path from the top-left corner to the bottom-right corner, moving only down or right.
• Find the minimum number of boats required to transport all people across a river, where each person has a weight and each boat has a weight limit.
• 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.