🎉 Day 18

Author: AkashRajpurohit

README.md

@@ -26,6 +26,7 @@
 1. [Non-overlapping Intervals](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/550/week-2-august-8th-august-14th/3425/) ➡️ [CPP Solution](Week3/eraseOverlapIntervals.cpp)
 2. [Best Time to Buy and Sell Stock III](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/550/week-2-august-8th-august-14th/3426/) ➡️ [CPP Solution](Week3/maxProfit.cpp)
 3. [Distribute Candies to People](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/550/week-2-august-8th-august-14th/3427/) ➡️ [CPP Solution](Week3/distributeCandies.cpp)
+4. [Numbers With Same Consecutive Differences](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/550/week-2-august-8th-august-14th/3428/) ➡️ [CPP Solution](Week3/numsSameConsecDiff.cpp)
 
 ## Week 4 🚧
 Coming Soon...

Week3/numsSameConsecDiff.cpp

@@ -0,0 +1,30 @@
+class Solution {
+    void dfs(int K, int currentNumber, int digitsLeft, vector<int>& res) {
+        if(digitsLeft == 0) {
+            res.push_back(currentNumber);
+            return;
+        }
+        
+        int lastDigit = currentNumber % 10;
+        
+        if((lastDigit + K) <= 9) {
+            dfs(K, (currentNumber * 10) + lastDigit + K, digitsLeft - 1, res);
+        }
+        
+        if((lastDigit - K) >= 0 && K != 0) {
+            dfs(K, (currentNumber * 10) + lastDigit - K, digitsLeft - 1, res);
+        }
+    }
+public:
+    vector<int> numsSameConsecDiff(int N, int K) {
+        vector<int> res;
+        
+        if(N == 1) return {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
+        
+        for(int i = 1; i < 10; ++i) {
+            dfs(K, i, N - 1, res);   
+        }
+        
+        return res;
+    }
+};