🔴 Title : Activity Selection Problem
🔴 Directory : Greedy Algorithm
🔴 Name : Abhishek Sharma
🔴 Contribution type :

• Hacktoberfest 2022
• Contributor

🔴 Approach : To solve this problem, I'll be using Greedy approach.

🔴 Problem Statement : You are given n activities with their start and finish times. Select the maximum number of activities that can be performed by a single person, assuming that a person can only work on a single activity at a time.
Examples:

Input: Consider the following 3 activities sorted by finish time. start[] = {10, 12, 20} finish[] = {20, 25, 30} Output: {0, 2} Explanation: A person can perform at most two activities. The maximum set of activities that can be executed is {0, 2} [ These are indexes in start[] and finish[] ] 

@prathimacode-hub Please assign me this issue, I'll be contributing as a Hacktoberfest 2022 participant.