AniketTheProgrammer
Home
(current)
Courses
Projects
YT Projects
Coding Questions
Notification
Contact Us
Log In
All Topics
C Language
C++ Language
Greedy Algorithm
Hashing
Java Language
Linked List
Python
Queue
Stack
String
Sorting
Searching
Recursion
Backtracking
Dynamic Programming
Graph Theory
Bit Manipulation
Mathematics
Sliding Window Technique
Divide And Conquer
Matrix Manipulation
Two Pointers
Binary Tree
Topic: Greedy-algorithms-question / Level: Advanced
518. Write a program to determine the maximum number of intervals that can be scheduled without overlap.
519. Implement a greedy algorithm to find the maximum weight that can be carried in a knapsack given weights and values.
520. Write a program to calculate the maximum number of activities that can be completed based on start and finish times.
521. Given a series of stock prices, write a function to find the maximum profit that can be achieved through multiple buy-sell transactions.
522. Implement a greedy algorithm to solve the job scheduling problem with maximum profit.
523. Write a function to find the minimum number of cuts needed to partition a string into palindromic substrings.
524. Given a list of tasks with deadlines and profits, find the maximum profit obtainable by scheduling the tasks efficiently.
525. Write a program to calculate the maximum number of tasks that can be completed with specific deadlines.
526. Implement a greedy algorithm to find the optimal way to connect all cities with the minimum cost.
527. Given a list of intervals, merge overlapping intervals to minimize the total number of intervals required.
528. Implement a greedy algorithm to solve the traveling salesman problem.
529. Write a program to determine if it is possible to partition an array into k subsets with equal sum.
530. Given a sequence of integers, find the minimum number of operations required to make all elements equal.
531. Implement a greedy algorithm to find the largest number that can be formed from a list of integers.
532. Write a function to determine the maximum number of activities that can be completed based on start and finish times.
533. Given a list of coins, find the minimum number of coins required to make change for a given amount using a greedy strategy.
534. Implement a greedy algorithm to merge overlapping intervals to minimize the total number of intervals required.
535. Write a program to find the maximum value of items that can be packed in a knapsack using a greedy approach.
536. Given a series of stock prices, write a program to find the maximum profit that can be achieved through multiple buy-sell transactions.
Previous
1
2
3
4
5
6
7
8
Next
More Levels
Beginner
Intermediate
Most Visited
Calculate the minimum cost of connecting a given set of points on a grid.
Write a function to find the maximum sum of non-adjacent elements in an array.
Write a function to determine the maximum number of activities that can be completed based on start and finish times.
Write a program to determine the maximum number of activities that can be completed based on start and finish times.
Given a set of intervals, write a program to find the maximum number of non-overlapping intervals.
Given a set of tasks, determine the maximum profit obtainable by efficiently scheduling the tasks.
Determine the maximum number of activities that can be completed based on start and finish times.
Write a program to find the maximum number of activities that can be completed without overlapping time slots.
Implement a function to find the maximum number of non-overlapping tasks that can be completed within a time limit.
Given a series of stock prices, write a function to determine the maximum profit achievable through multiple buy-sell transactions.
Implement a function to find the optimal way to partition a string into palindromic substrings.
Implement a greedy algorithm to solve the fractional knapsack problem for a given set of items.
Write a program to determine the minimum number of platforms needed at a train station for a given set of schedules.
Given a list of tasks with deadlines and profits, find the maximum profit obtainable by scheduling the tasks efficiently.
Implement a function that computes the maximum value obtainable from a set of items with given weights and values.