https://github.com/fawredd/faw-string-permutations

This function takes a string and generates all possible arrangements (permutations) of its characters. It considers all substrings, from single characters to the entire string.
https://github.com/fawredd/faw-string-permutations

Last synced: 4 months ago
JSON representation

This function takes a string and generates all possible arrangements (permutations) of its characters. It considers all substrings, from single characters to the entire string.

• Host: GitHub
• URL: https://github.com/fawredd/faw-string-permutations
• Owner: fawredd
• Created: 2024-07-11T01:14:04.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2024-07-11T03:02:20.000Z (over 1 year ago)
• Last Synced: 2024-07-11T04:26:35.676Z (over 1 year ago)
• Language: JavaScript
• Size: 12.7 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
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