leetcode 3394 solution

Updated this repo with leetcode problem 3394 with cpp code

Author: rishabh-xyd

solution/3300-3399/3394.Check if Grid can be Cut into Sections/README.md

@@ -115,7 +115,38 @@ tags:
 #### C++
 
 ```cpp
-
+class Solution {
+public:
+vector<vector<int>> merge(vector<vector<int>>& intervals){
+    int n=intervals.size();
+    sort(begin(intervals),end(intervals));
+    vector<vector<int>>result;
+    result.push_back(intervals[0]);
+    for(int i=0;i<n;i++){
+        if(intervals[i][0]<result.back()[1])
+         result.back()[1]=max(result.back()[1],intervals[i][1]);
+    else result.push_back(intervals[i]);
+    }
+    return result;
+}
+    bool checkValidCuts(int n, vector<vector<int>>& rectangles) {
+        vector<vector<int>>hor;
+        vector<vector<int>>vert;
+        for(auto &cord:rectangles){
+            int x1=cord[0];
+            int y1=cord[1];
+            int x2=cord[2];
+            int y2=cord[3];
+            hor.push_back({x1,x2});
+            vert.push_back({y1,y2});
+        }
+        vector<vector<int>> result1= merge(hor);
+        if(result1.size()>=3)
+        return true;
+        vector<vector<int>> result2=merge(vert);
+        return result2.size()>=3;    
+    }
+};
 ```
 
 #### Go