More Problems

• Distribute exam slots to students such that no two exams overlap, and the total number of exam slots used is minimized.
• Find the minimum number of jumps required to reach the end of an array, where each element represents the maximum number of jumps you can make.
• You are given a list of people with their weights. Find the minimum number of buses required to transport all people without exceeding a weight limit.
• Find the minimum number of steps required to make all elements in an array equal, where only increments or decrements are allowed.
• You are given a list of jobs with durations and deadlines. Minimize the total penalty for jobs completed after their deadlines.
• Find the maximum number of meetings that can be attended from a list of meetings with start and end times.
• You are given a set of items with values and weights. Find the subset of items that maximizes the value without exceeding a weight limit using the greedy approach.
• Given a list of intervals representing jobs, find the maximum number of jobs that can be scheduled without overlaps.