Topic: Greedy-algorithms-question / Level: Advanced

• 338. Write a program that determines if it is possible to partition an array into two subsets with equal sum.
• 339. Given a list of coins, find the minimum number of coins needed to achieve a target sum.
• 340. Implement a function to find the maximum number of non-overlapping tasks that can be completed within a time limit.
• 341. Write a program to find the minimum cost of connecting a given set of points on a grid.
• 342. Given an array of weights, determine the maximum number of items that can be packed into a knapsack with a weight limit.
• 343. Implement a greedy algorithm to schedule the maximum number of jobs given their start and finish times.
• 344. Write a program that calculates the maximum sum of non-adjacent elements in an array.
• 345. Given a set of items with weights and values, find the maximum value obtainable within a weight limit using a greedy approach.
• 346. Implement a function that computes the minimum number of swaps needed to sort an array.
• 347. Write a program that determines the optimal way to partition an array to minimize the maximum sum of subarrays.
• 348. Given an array of tasks with deadlines and profits, find the maximum profit obtainable by scheduling the tasks.
• 349. Implement a function to find the largest number that can be formed from a given list of integers.
• 350. Write a program to calculate the maximum value of items that can be packed in a knapsack given weight limits and values.
• 351. Given a list of tasks and their respective completion times, determine the minimum time needed to complete all tasks.
• 352. Implement a greedy algorithm to solve the job scheduling problem with maximum profit.
• 353. Write a function to find the minimum number of coins needed to reach a target sum.
• 354. Given an array of integers, determine the maximum profit that can be achieved through multiple buy-sell transactions.
• 355. Implement a greedy algorithm to find the minimum spanning tree of a graph.
• 356. Write a program to calculate the maximum number of intervals that can be scheduled without overlap.
• 357. Implement a greedy algorithm to find the optimal way to connect all cities with the minimum cost.
• 358. Write a program to solve the traveling salesman problem using a greedy approach.
• 359. Given a set of intervals, find the maximum number of non-overlapping intervals that can be selected.
• 360. Implement Dijkstra's algorithm to find the shortest path in a weighted graph.
• 361. Write a function to solve the minimum cost to cut a stick of given length.
• 362. Given a list of jobs with deadlines and profits, implement a function to maximize total profit.
• 363. Write a program to find the minimum number of platforms required at a train station given arrival and departure times.
• 364. Implement a greedy algorithm to solve the Huffman coding problem.
• 365. Given a set of weights and values, write a function to maximize the value in a knapsack with a weight limit using a greedy strategy.
• 366. Write a program to determine the minimum number of coins required to make change for a given amount using a greedy approach.
• 367. Implement Kruskal’s algorithm to find the minimum spanning tree of a graph.

• More Levels

• Beginner
• Intermediate