Given a string, make a function that returns the number of posible character combinations. INPUT: "CCB" OUTPUT: 8
8 is the result of theese combinations: C, B, CC, CB, BC, CCB, CBC, BCC
#javascript #dfs #backtrack #permute #permutation #filter
-
Notifications
You must be signed in to change notification settings - Fork 0
Uses backtracking (DFS-style traversal) to explore all character arrangements from the input string. Tracks each recursion depth (tree level) and stores the generated paths. After recursion, it removes duplicates at each level and returns the count of all unique character paths (not just full permutations).
fawredd/faw-string-permutations
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Uses backtracking (DFS-style traversal) to explore all character arrangements from the input string. Tracks each recursion depth (tree level) and stores the generated paths. After recursion, it removes duplicates at each level and returns the count of all unique character paths (not just full permutations).
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published