Topic: Greedy-algorithms-question / Level: Advanced

• 368. Given a sequence of jobs, implement a function to maximize the number of jobs done with deadlines.
• 369. Write a program to merge k sorted linked lists using a greedy approach.
• 370. Implement a greedy algorithm to solve the fractional knapsack problem with fractional values.
• 371. Given an array of tasks with deadlines and profits, find the maximum profit obtainable by scheduling tasks optimally.
• 372. Write a function to determine the maximum number of intervals that can be scheduled without overlapping.
• 373. Implement a greedy algorithm to find the maximum sum of non-adjacent elements in an array.
• 374. Given a series of stock prices, write a program to determine the maximum profit from buying and selling once.
• 375. Implement a function to partition a set into two subsets with a minimal difference in their sums using a greedy approach.
• 376. Write a program to determine the optimal way to cut a rod to maximize revenue.
• 377. Given a list of points, implement a greedy algorithm to find the closest pair of points.
• 378. Write a function to find the minimum spanning tree using Prim's algorithm.
• 379. Implement a greedy algorithm to solve the activity selection problem.
• 380. Given a list of coins, find the minimum number of coins needed to achieve a target sum using a greedy strategy.
• 381. Write a program to determine if it's possible to partition an array into k subsets with equal sum.
• 382. Implement a greedy algorithm to schedule the maximum number of jobs given start and finish times.
• 383. Given a sequence of integers, find the largest sum of any contiguous subarray using a greedy approach.
• 384. Write a function to find the maximum profit obtainable from multiple buy-sell transactions of stock prices.
• 385. Implement a greedy algorithm to find the maximum weight that can be carried in a knapsack given weights and values.
• 386. Write a program to determine the optimal number of coins needed to make change for a given amount with a greedy strategy.
• 387. Given a list of intervals, merge overlapping intervals to minimize the total number of intervals.
• 388. Implement a greedy algorithm to solve the minimum cost path problem in a grid.
• 389. Write a program to find the optimal way to pack a knapsack given weights, values, and constraints.
• 390. Given a list of tasks, implement a function to find the maximum profit obtainable by efficiently scheduling them.
• 391. Write a program to find the minimum number of jumps required to reach the end of an array using a greedy approach.
• 392. Implement a greedy algorithm to solve the coin change problem with the fewest number of coins.
• 393. Given a series of tasks with deadlines, find the maximum number of tasks that can be completed on time.
• 394. Write a function to compute the minimum cost of connecting n points in a 2D plane.
• 395. Implement a greedy algorithm to find the maximum number of activities that can be performed based on start and finish times.
• 396. Write a program to find the minimum spanning tree using a priority queue.
• 397. Given a list of intervals, determine the maximum number of activities that can be scheduled without conflict.

• More Levels

• Beginner
• Intermediate