🔥 Day 27

Author: AkashRajpurohit

README.md

@@ -39,8 +39,9 @@
 1. [Random Point in Non-overlapping Rectangles](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/552/week-4-august-22nd-august-28th/3433/) ➡️ [CPP Solution](Week4/randomPoint.cpp)
 2. [Stream of Characters](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/552/week-4-august-22nd-august-28th/3434/) ➡️ [CPP Solution](Week4/streamChecker.cpp)
 3. [Sum of Left Leaves](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/552/week-4-august-22nd-august-28th/3435/) ➡️ [CPP Solution](Week4/sumOfLeftLeaves.cpp)
-4. [Minimum Cost For Tickets](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/552/week-4-august-22nd-august-28th/3435/) ➡️ [CPP Solution](Week4/mincostTickets.cpp)
-5. [Fizz Buzz](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/552/week-4-august-22nd-august-28th/3435/) ➡️ [CPP Solution](Week4/fizzBuzz.cpp)
+4. [Minimum Cost For Tickets](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/552/week-4-august-22nd-august-28th/3436/) ➡️ [CPP Solution](Week4/mincostTickets.cpp)
+5. [Fizz Buzz](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/552/week-4-august-22nd-august-28th/3437/) ➡️ [CPP Solution](Week4/fizzBuzz.cpp)
+6. [Find Right Interval](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/552/week-4-august-22nd-august-28th/3438/) ➡️ [CPP Solution](Week4/findRightInterval.cpp)
 
 ## Week 5 🚧
 

Week4/findRightInterval.cpp

@@ -0,0 +1,26 @@
+class Solution {
+public:
+    vector<int> findRightInterval(vector<vector<int>>& intervals) {
+        map<int, int> m;
+        vector<int> result;
+        int n = intervals.size();
+        
+        if(n == 0) return {};
+        if(n == 1) return {-1};
+        
+        for(int i = 0; i < n; ++i) {
+            int start = intervals[i][0];
+            m[start] = i;
+        }
+        
+        for(int i = 0; i < n; ++i) {
+            int end = intervals[i][1];
+            auto it = m.lower_bound(end);
+            
+            int index = it != m.end() ? it -> second : -1;
+            result.push_back(index);
+        }
+        
+        return result;
+    }
+};