Topic: Greedy-algorithms-question / Level: Intermediate

• 178. Write a program to find the minimum number of coins needed to make a given amount using denominations.
• 179. Given an array of jobs with deadlines and profits, implement a greedy algorithm to maximize total profit.
• 180. Write a function to find the minimum spanning tree of a graph using Kruskal's algorithm.
• 181. Implement a program to find the maximum sum of non-adjacent elements in an array.
• 182. Given a set of intervals, write a program to find the maximum number of non-overlapping intervals.
• 183. Implement a function to determine the minimum cost to connect all cities given their distances.
• 184. Write a program to solve the fractional knapsack problem.
• 185. Given an array of integers, find the largest sum of any contiguous subarray using Kadane’s algorithm.
• 186. Implement a function to find the maximum number of activities that can be completed based on their start and finish times.
• 187. Write a program to find the longest increasing subsequence in an array using a greedy approach.
• 188. Given a set of points on a 2D plane, write a function to find the minimum distance to connect all points.
• 189. Implement a program to find the minimum number of platforms needed at a train station for a given schedule.
• 190. Write a function to find the maximum number of non-overlapping meetings in a room.
• 191. Given a list of weights and values, implement a greedy algorithm to maximize the value in a knapsack with a weight limit.
• 192. Write a program to schedule tasks with deadlines to maximize profit.
• 193. Given a set of coins, find the combinations of coins that add up to a target sum.
• 194. Implement a function to find the maximum product obtainable from a list of integers.
• 195. Write a program to determine the minimum number of cuts required to partition a string into palindromic substrings.
• 196. Given an array of jobs with their start and finish times, find the maximum number of jobs that can be completed.
• 197. Implement a function to find the minimum number of swaps required to sort an array.
• 198. Write a program to determine if it is possible to partition an array into two subsets with equal sum.
• 199. Given a list of tasks with completion times, find the optimal schedule to minimize total completion time.
• 200. Implement a function to find the maximum length of a chain of pairs.
• 201. Write a program to compute the minimum number of moves to make a string palindrome.
• 202. Given a set of jobs with their respective deadlines and profits, find the maximum profit obtainable by scheduling the jobs.
• 203. Implement a greedy algorithm to determine the maximum number of tasks that can be completed on time.
• 204. Write a program to find the largest number that can be formed by concatenating a list of integers.
• 205. Given a series of stock prices, determine the maximum profit that can be achieved through one buy-sell transaction.
• 206. Implement a function to merge overlapping intervals in a list.
• 207. Write a program to find the maximum value obtainable from a set of items with given weights and values.

• More Levels

• Beginner
• Advanced