Topic: Greedy-algorithms-question / Level: Advanced

• 308. Given a set of tasks, determine the maximum profit obtainable by efficiently scheduling the tasks.
• 309. Implement a function to find the optimal way to partition a string into palindromic substrings.
• 310. Write a program that calculates the minimum cost of connecting all points in a 2D plane.
• 311. Given a list of jobs with deadlines, implement a function to determine if all jobs can be completed on time.
• 312. Write a function to find the maximum sum of non-adjacent elements in an array.
• 313. Implement a greedy algorithm to solve the fractional knapsack problem with fractional weights.
• 314. Given a set of weights and values, write a program to find the maximum value obtainable in a knapsack with a weight limit.
• 315. Implement a function to find the minimum number of platforms needed at a train station for a given set of train schedules.
• 316. Write a program to find the maximum number of tasks that can be completed without overlapping time slots.
• 317. Given a list of integers, implement a function to return the minimum number of deletions required to make the array strictly increasing.
• 318. Implement a greedy algorithm to determine the maximum number of activities that can be completed based on start and finish times.
• 319. Write a program to find the optimal job schedule to maximize profit.
• 320. Given a series of stock prices, write a function to determine the maximum profit that can be achieved through one buy-sell transaction.
• 321. Implement a function to find the minimum number of swaps required to sort an array.
• 322. Write a program to merge overlapping intervals in a list.
• 323. Given a set of items with weights and values, implement a greedy algorithm to maximize the value in a knapsack with a weight limit.
• 324. Implement a greedy algorithm to select the maximum number of intervals that can be attended based on their start and end times.
• 325. Write a program to determine if it is possible to partition an array into three subsets with equal sum.
• 326. Given an array of integers, find the largest sum of any contiguous subarray using Kadane’s algorithm.
• 327. Write a function that computes the minimum number of coins needed to achieve a target sum.
• 328. Implement a greedy algorithm to find the maximum weight that can be carried in a knapsack given weights and values.
• 329. Write a program to find the minimum number of cuts needed to partition a string into palindromic substrings.
• 330. Given a set of jobs with deadlines and profits, find the maximum profit obtainable by scheduling the jobs.
• 331. Implement a function to find the maximum product obtainable from a list of integers.
• 332. Write a program that calculates the maximum number of activities that can be scheduled without overlap.
• 333. Given a list of intervals, merge overlapping intervals to minimize the total number of intervals.
• 334. Implement a function that computes the maximum value obtainable from a set of items with given weights and values.
• 335. Write a program that returns the longest common subsequence of two strings using a greedy approach.
• 336. Given an array of integers, determine the minimum number of deletions required to make the array strictly increasing.
• 337. Implement a greedy algorithm to find the minimum number of platforms required at a train station given a set of train schedules.

• More Levels

• Beginner
• Intermediate