BANANAGRAMATOR ð
ð BANANAGRAMATOR
How to Use
-
Type or paste the text to rearrange on the input box.
Maximum of
3,628,800(three million six hundred and twenty-eight thousand eight hundred) rearrangements (10!).Acceptable characters: A-Z or 0-9 or any other characters (besides
white space) that can be rendered inHTML.Supports emoji or Unicode character like ðĩðŦ ðĪ·♂️ ðŦ ➼ ▶ áīą áīđ áīž áĩ áĩĒ áĩĨ â
-
We can use the
Patterninput to gate the permutation results.The gate will match only permutations that begin with the pattern. ðĪ
This will be applied as a prefix filter — only permutations starting with the pattern will be returned.
For instance, we want to get the rearranged letters from
monkey, if we putkeyfor the gating pattern, it will produce:key[permutation results]Actual output:
keymno, keymon, keynmo, keynom, keyomn, keyonmAnother example,
bananaand we putnanaas the pattern:nana[permutation results]Actual output:
nanaab, nanabaLast example, input is
primateandtrimas the pattern:trim[permutation results]Actual output:
trimaep, trimape, trimeap, trimepa, trimpae, trimpeaâđ️ If even one letter from the pattern is not found within the input, BANANAGRAMATOR will show us:
⚠️ [the pattern] does not appear in [the input].✅ The pattern can be random in sequence. But, please do make sure all pattern characters are in the input.
-
Click the RUN button or hit Enter on keyboard to run BANANAGRAMATOR.
There will be:- ALL TXT to open the output in a new tab.
- Button for each character for displaying the output in a new tab.
- DOWNLOAD ALL to download the output as text file.
For output size larger than 1,000 permutations, the result will not show the output directly. But we can still open it in a new tab or download it.
- To clear everything, hit CLEAR button or delete or modify the input.
- Please omit the white space from the input before computing.
MUSA POTENTIA
It is Latin for ð BANANA POWER ðĪ
