EdocGram
Home
(current)
Topics
EdocAI
Code Editor
HTML
Javascript
PHP
Python
Python AI Code Editor
More
Contact
About
Privacy Policy
Terms and Conditions
Log In
Topic: Greedy Algorithm Problem / Level: intermediate
Problem:
Given an array of integers representing tasks with durations, assign the tasks to two processors such that the total time to complete all tasks is minimized.
More Problems
You are given a set of people with different weights and a boat with a maximum capacity. Find the minimum number of boat trips required to transport all people.
You are given a list of jobs with deadlines and profits. Maximize the total profit by scheduling non-overlapping jobs optimally.
Given an array of stock prices, find the maximum profit that can be made by buying and selling the stock at most twice.
You are given a set of jobs with start and end times. Maximize the number of non-overlapping jobs that can be scheduled.
You are given a grid where each cell has a traversal cost. Find the minimum cost path from the top-left corner to the bottom-right corner, moving only right or down.
Given a list of meetings with start and end times, find the minimum number of meeting rooms required to accommodate all meetings.
You are given a set of tasks with deadlines and durations. Maximize the number of tasks that can be completed before their deadlines.
Find the minimum number of platforms required to accommodate a set of trains arriving and departing at different times.
Python
Language
Editor
Run & Output
Save
AI Code Generate
AI Test Case
Run the code to see the output here...