Skip to content

Adding Solution of problem 0030-Substring-with-Concatenation-of-All-Words #969

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
Jun 11, 2024
Merged

Adding Solution of problem 0030-Substring-with-Concatenation-of-All-Words #969

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
9a94e60
Create 0030-0030-Substring-with-Concatenation-of-All-Words
katarianikita2003 Jun 10, 2024
8abb4b7
Update 0017
katarianikita2003 Jun 10, 2024
5635c71
Merge branch 'main' into main
katarianikita2003 Jun 10, 2024
74eb2d4
Updated Code Basedon Suggestions
katarianikita2003 Jun 11, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 1 addition & 3 deletions dsa-solutions/lc-solutions/0000-0099/0017-Letter-Combinations-of-a-Phone-Number.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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'].`
Expand Down Expand Up @@ -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
Expand Down Expand Up @@ -314,4 +312,4 @@ Here's a step-by-step algorithm for generating all possible letter combinations
- Call the backtracking function with the initial index set to 0 and an empty string as the initial combination.
- Return the list of combinations.

This algorithm ensures that all possible combinations are generated by exploring all valid paths through backtracking.
This algorithm ensures that all possible combinations are generated by exploring all valid paths through backtracking.
2 changes: 0 additions & 2 deletions dsa-solutions/lc-solutions/0000-0099/0017-letter-combinations-of-a-phone-number.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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'].`
Expand Down Expand Up @@ -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
Expand Down
Loading
Loading