An efficient combinatorics library for JavaScript to generate and get the list of all Permutations and Combinations with the ability to enable or disable repetition. (utilizing ES2015 generators)

Performs a permutation of the input string and returns only valid English words that can be formed from the letters

🧠 Permutant finds every possible permutation of an array using Heap's Algorithm.

The game is played using a plastic grid of lettered dice, in which players attempt to find words in sequences of adjacent letters.

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

Anagram Generator

Permutation generator based on Heap’s Algorithm

Invertible transformations on permutation representations, including an RNG-free in-place Fisher-Yates-Knuth shuffle https://www.npmjs.com/package/factoradic

Converts alphanumeric codes into numbers.

permutation cipher for encrypting and decrypting a hexadecimal string