[REQUEST] Add Interval Scheduling (GREEDY) in C++

[Jayesh-Waghmare]

Algorithm Name

Interval Scheduling

Programming Language

C++

Category

Greedy Algorithms

Difficulty Level

Medium (Intermediate)

Algorithm Description

Algorithm Name

Interval Scheduling (Greedy Algorithm)

Programming Language

C++

Category

Greedy Algorithms

Difficulty Level

Medium

Algorithm Description

The Interval Scheduling algorithm is a classic greedy approach for selecting the maximum number of non-overlapping intervals (or activities) from a set of intervals.
The strategy is:

Sort all intervals by their finishing times.

Iteratively select the interval that finishes earliest and is compatible with the previously chosen intervals.

Continue until no more intervals can be chosen.

This greedy method is optimal for interval scheduling problems, as it guarantees the maximum number of compatible activities.

References (Optional)

No response

Contribution Intent

• I would like to implement this algorithm myself
• I'm requesting this for someone else to implement
• I need help implementing this algorithm

Code of Conduct

• I agree to follow this project's Code of Conduct

[Jayesh-Waghmare]

Hi @Karanjot786, please assign this issue to me

[Jayesh-Waghmare]

I have added the PR #269 @Karanjot786