More Problems

• 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.
• You are given a set of coins with different denominations. Find the minimum number of coins required to make an exact change for a given amount using the Greedy algorithm.
• You are given a set of events, each with a start and end time. Maximize the number of events that can be attended without overlap.
• Given a list of train arrival and departure times, find the minimum number of platforms required at a station to accommodate all trains.
• You are given a list of jobs, each with a deadline and a profit. Maximize the total profit by scheduling the jobs optimally, ensuring no two jobs overlap.
• Given a string of lowercase letters, rearrange the characters so that adjacent characters are different and the string is lexicographically smallest.
• You are given a grid representing a city, where each cell has a number representing the cost to pass through. Find the minimum cost to travel from the top-left corner to the bottom-right corner of the grid.
• Given an array of integers, maximize the sum of selected elements such that no two selected elements are adjacent.