✨ Day 28; Week 4 ✔️

Author: AkashRajpurohit

README.md

@@ -35,14 +35,15 @@
 7. [Asteroid Collision](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/561/week-3-october-15th-october-21st/3502/) ➡️ [CPP Solution](Week3/asteroidCollision.cpp)
 
 
-## Week 4 🚧
+## Week 4 ✅
 
 1. [Minimum Depth of Binary Tree](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/562/week-4-october-22nd-october-28th/3504/) ➡️ [CPP Solution](Week4/minDepth.cpp)
 2. [132 Pattern](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/562/week-4-october-22nd-october-28th/3505/) ➡️ [CPP Solution](Week4/find132pattern.cpp)
 3. [Bag of Tokens](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/562/week-4-october-22nd-october-28th/3506/) ➡️ [CPP Solution](Week4/bagOfTokensScore.cpp)
 4. [Stone Game IV](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/562/week-4-october-22nd-october-28th/3507/) ➡️ [CPP Solution](Week4/winnerSquareGame.cpp)
 5. [Champagne Tower](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/562/week-4-october-22nd-october-28th/3508/) ➡️ [CPP Solution](Week4/champagneTower.cpp)
 6. [Linked List Cycle II](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/562/week-4-october-22nd-october-28th/3509/) ➡️ [CPP Solution](Week4/detectCycle.cpp)
+7. [Summary Ranges](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/562/week-4-october-22nd-october-28th/3510/) ➡️ [CPP Solution](Week4/summaryRanges.cpp)
 
 ## Week 5 🚧
 

Week4/summaryRanges.cpp

@@ -0,0 +1,40 @@
+class Solution {
+public:
+    vector<string> summaryRanges(vector<int>& nums) {
+        int n = nums.size();
+        vector<string> result;
+        
+        if(n == 0) return result;
+        
+        int start = nums[0], end = nums[0];
+        string val;
+        
+        for(int i = 1; i < n; ++i) {
+            if(end + 1 == nums[i]) {
+                end = nums[i];
+                continue;
+            }
+            
+            if(start == end) {
+                val = to_string(start);
+                result.push_back(val);
+            } else {
+                val = to_string(start) + "->" + to_string(end);
+                result.push_back(val);
+            }
+            
+            start = nums[i];
+            end = nums[i];
+        }
+        
+        if(start == end) {
+            val = to_string(start);
+            result.push_back(val);
+        } else {
+            val = to_string(start) + "->" + to_string(end);
+            result.push_back(val);
+        }
+        
+        return result;
+    }
+};