diff --git a/greedy_algorithms/activity_selection.cpp b/greedy_algorithms/activity_selection.cpp
new file mode 100644
index 00000000000..a7027fafed9
--- /dev/null
+++ b/greedy_algorithms/activity_selection.cpp
@@ -0,0 +1,91 @@
+/**
+ * @file
+ * @brief
+ * [https://www.geeksforgeeks.org/greedy-algorithms/] - Greedy algorithm
+ * Problem info: https://www.geeksforgeeks.org/activity-selection-problem-greedy-algo-1/
+ *
+ * @details
+ * 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.
+ *
+ * Input: start[]  =  {10, 12, 20}, finish[] =  {20, 25, 30}
+ * Output: 0
+ * Explanation: A person can perform at most one activities.
+ *
+ *
+ *  Input: start[]  =  {1, 3, 0, 5, 8, 5}, finish[] =  {2, 4, 6, 7, 9, 9};
+ *  Output: 0 1 3 4
+ *  Explanation: A person can perform at most four activities. The
+ *  maximum set of activities that can be executed
+ *  is {0, 1, 3, 4} [ These are indexes in start[] and finish[]
+ *
+ * @Approach
+ * Since the activities are sorted in increasing order of finish time, we chose the activity whose finish time is less than
+ * all other activities and start time is more than the previous activities finish time. We should sort the activities in
+ * increasing order of finish time of activities.
+ *
+ * @author [Chhavi Bansal](https://github.com/chhavibansal)
+*/
+
+// The assumption here is input activities will be provided in sorted order of finish time of activities.
+#include <cassert>   /// for assert
+#include <iostream>
+#include <vector>
+
+// Prints a maximum set of activities that can be done by a
+// single person, one at a time.
+std::vector<int> getMaxActivities(std::vector<int> start, std::vector<int> finish, int n)
+{
+    int i, j;
+    std::vector<int> ans;
+
+
+    // Since we greedily start selecting the activities the first activity is always selected
+    i = 0;
+    ans.push_back(i);
+
+    // Considering the rest of the activities
+    for (j = 1; j < n; j++) {
+        // If this activity has start time greater than or
+        // equal to the finish time of previously selected
+        // activity, then select it
+        if (start[j] >= finish[i]) {
+            ans.push_back(j);
+            i = j;
+        }
+    }
+    return ans;
+}
+
+static void tests() {
+    std::vector<int> start = {1, 3, 0, 5, 8, 5};
+    std::vector<int> finish = {2, 4, 6, 7, 9, 9};
+
+    std::vector<int> ans = getMaxActivities(start, finish, start.size());
+    // activity 0, 1, 3, 4 are selected since their start time is greater than the end time of the previous activity
+    std::vector<int> activities = {0, 1, 3, 4};
+
+    for(int i = 0 ; i < activities.size(); i++){
+        uint64_t activityNumber = ans[i];
+        assert(activityNumber == activities[i]);
+    }
+    std::vector<int> start2 = {10, 12, 20};
+    std::vector<int> finish2 = {20, 25, 30};
+
+    std::vector<int> ans2 = getMaxActivities(start2, finish2, start2.size());
+    // only the first activity is chosen, others dont fulfill the criteria
+    std::vector<int> activities2 = {0};
+
+    for(int i = 0 ; i < activities2.size(); i++){
+        uint64_t activityNumber = ans2[i];
+        assert(activityNumber == activities2[i]);
+    }
+
+}
+
+// Driver code
+int main()
+{
+    tests();
+    return 0;
+}