Skip to content
#

recursive-tree-traversal

Star

Here is 1 public repository matching this topic...

fawredd / faw-string-permutations

Star 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).

javascript backtracking dfs combinatorial-search permutation-algorithms recursive-tree-traversal
  • Updated Jul 11, 2024
  • JavaScript

Improve this page

Add a description, image, and links to the recursive-tree-traversal topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the recursive-tree-traversal topic, visit your repo's landing page and select "manage topics."

Learn more