Skip to content
#

combinatorial-search

Here are 29 public repositories matching this topic...

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

  • Updated Jun 17, 2025
  • JavaScript

Add this topic to your repo

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

Learn more