More Problems

• Given an array of integers, partition the array into two subsets such that the sum difference between the two subsets is minimized.
• You are given a list of events with start and end times. Maximize the number of non-overlapping events that can be attended.
• You are given a set of jobs with deadlines and durations. Maximize the number of jobs that can be completed before their deadlines.
• Given a list of people with weights, find the minimum number of elevator trips required to transport all people without exceeding the weight limit of the elevator.
• You are given an array of integers representing the number of steps that can be taken forward from each element. Find the minimum number of jumps required to reach the last element of the array.
• Given a grid where each cell represents a cost, find the minimum cost path from the top-left corner to the bottom-right corner, moving only right or down.
• You are given a set of items, each with a weight and a value. Maximize the total value that can be carried in a knapsack with a fixed capacity using the fractional knapsack approach.
• You are given a list of trains with their arrival and departure times. Find the minimum number of platforms required at the station to accommodate all the trains.