Day-27

class Solution {
public:
    vector<vector<int>> overlappedInterval(vector<vector<int>>& intervals) {
         // Code here
          vector<vector<int>> mergedIntervals;
       if(intervals.size()==0)
           return mergedIntervals;
       sort(intervals.begin(), intervals.end());
       vector<int> tempInterval = intervals[0];
       for(auto it: intervals )
       {
           if(it[0] <= tempInterval[1])
               tempInterval[1] = max(it[1], tempInterval[1]);
           else
           {
               mergedIntervals.push_back(tempInterval);
               tempInterval = it;
           }
               
       }
       mergedIntervals.push_back(tempInterval);
       return mergedIntervals;
    }
};