feat: Add Weighted Job Scheduling algorithm to dynamic programming #13378
Conversation
- Implemented efficient Weighted Job Scheduling algorithm using Dynamic Programming and Binary Search - Time Complexity: O(n log n), Space Complexity: O(n) - Added comprehensive documentation and example usage - Includes proper author attribution and date - Fixed linting issues: removed unused imports and applied formatting Hacktoberfest contribution - Dynamic Programming implementation for finding maximum profit from non-overlapping job intervals
algorithms-keeper
bot
added
require descriptive names
![algorithms-keeper[bot]](https://avatars.githubusercontent.com/in/235834?s=60&v=4){kind=small}
There was a problem hiding this comment.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper reviewto trigger the checks for only added pull request files@algorithms-keeper review-allto trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
| """ | ||
|
|
||
|
|
||
| def find_last_non_conflicting(jobs, index): |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file dynamic_programming/weighted_job_scheduling.py, please provide doctest for the function find_last_non_conflicting
Please provide return type hint for the function: find_last_non_conflicting. If the function does not return a value, please provide the type hint as: def function() -> None:
Please provide type hint for the parameter: jobs
Please provide type hint for the parameter: index
| return -1 | ||
|
|
||
|
|
||
| def weighted_job_scheduling(jobs): |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file dynamic_programming/weighted_job_scheduling.py, please provide doctest for the function weighted_job_scheduling
Please provide return type hint for the function: weighted_job_scheduling. If the function does not return a value, please provide the type hint as: def function() -> None:
Please provide type hint for the parameter: jobs
| """ | ||
|
|
||
| # Step 1: Sort jobs by their finish time | ||
| jobs.sort(key=lambda x: x[1]) |
There was a problem hiding this comment.
Please provide descriptive name for the parameter: x
- Fixed remaining line length issues in docstrings - All lines now comply with 88 character limit - Removed trailing whitespace - Addresses algorithms-keeper bot formatting requirements
algorithms-keeper
bot
removed
require descriptive names
1 participant
Hacktoberfest contribution - Dynamic Programming implementation for finding maximum profit from non-overlapping job intervals
Describe your change:
This PR adds a new Weighted Job Scheduling algorithm to the dynamic programming section. The algorithm solves the classic problem of selecting a subset of jobs with maximum total profit where no two jobs overlap in time. The solution uses dynamic programming combined with binary search for optimal efficiency.
Key Features:
Algorithm Details:
Checklist: