File tree Expand file tree Collapse file tree 1 file changed +3
-3
lines changed
dsa-solutions/lc-solutions/0000-0099 Expand file tree Collapse file tree 1 file changed +3
-3
lines changed Original file line number Diff line number Diff line change 11---
2- id : Letter Combinations of a Phone Number
2+ id : letter-combinations-of-a-phone-number
33title : Letter Combinations of a Phone Number (LeetCode)
4- sidebar_label : 0017- Letter- Combinations-of-a- Phone- Number
4+ sidebar_label : 0017 Letter Combinations of a Phone Number
55tags :
66 - Back Tracking
77 - Mapping
@@ -313,4 +313,4 @@ Here's a step-by-step algorithm for generating all possible letter combinations
313313 - Call the backtracking function with the initial index set to 0 and an empty string as the initial combination.
314314 - Return the list of combinations.
315315
316- This algorithm ensures that all possible combinations are generated by exploring all valid paths through backtracking.
316+ This algorithm ensures that all possible combinations are generated by exploring all valid paths through backtracking.
You can’t perform that action at this time.
0 commit comments