Merge pull request #969 from katarianikita2003/main

ajay-dhangar · web-flow · commit 487a8aea373d · 2024-06-11T20:31:06.000+05:30
Adding Solution of problem 0030-Substring-with-Concatenation-of-All-Words
diff --git a/dsa-solutions/lc-solutions/0000-0099/0017-Letter-Combinations-of-a-Phone-Number.md b/dsa-solutions/lc-solutions/0000-0099/0017-Letter-Combinations-of-a-Phone-Number.md
@@ -39,7 +39,6 @@ Given a string containing digits from 2-9 inclusive, return all possible letter
 - **Output:** `["a","b","c"]`
 
 ### Constraints:
-
 - `0 ≤ digits.length ≤ 4`
 - `0 ≤ digits.length ≤ 4digits[𝑖]`
 - `digits[i] is a digit in the range ['2', '9'].`
@@ -70,7 +69,6 @@ Given a string containing digits from 2-9 inclusive, return all possible letter
 This approach ensures that all possible combinations are generated using backtracking, and the result is returned in the desired format.
 
 ### Solution Code
-
 #### Python
 
 ```python
diff --git a/dsa-solutions/lc-solutions/0000-0099/0017-letter-combinations-of-a-phone-number.md b/dsa-solutions/lc-solutions/0000-0099/0017-letter-combinations-of-a-phone-number.md
@@ -40,7 +40,6 @@ Given a string containing digits from 2-9 inclusive, return all possible letter
 - **Output:** `["a","b","c"]`
 
 ### Constraints:
-
 - `0 ≤ digits.length ≤ 4`
 - `0 ≤ digits.length ≤ 4digits[𝑖]`
 - `digits[i] is a digit in the range ['2', '9'].`
@@ -74,7 +73,6 @@ Given a string containing digits from 2-9 inclusive, return all possible letter
 This approach ensures that all possible combinations are generated using backtracking, and the result is returned in the desired format.
 
 ### Solution Code
-
 #### Python
 
 ```python
diff --git a/dsa-solutions/lc-solutions/0000-0099/0030 - SubString-with-Concatenation-of-all-words.md b/dsa-solutions/lc-solutions/0000-0099/0030 - SubString-with-Concatenation-of-all-words.md
