hello,
I am trying to find all the possible letter combinations of a word.
But I want the word to keep the same length, just the letters that move to form all the combinations
For example :
my_word : hello
combinations : hello, helol, heoll, hoell, hlelo, ...
Thanks for your help
From your example you want permutations, not combinations.
How many letters can your words have?
Hi, thanks for your replyOriginally Posted by 6StringJazzer
I hesitated between the two because I only want the combinations/permutations of the same number of letters as the word.
For the number of letters, I would like to be able to enter any word (from 2 to n letters).
The permutations/combinaisons for a word of 3 letters are (for example):
word : cat
result : cat, cta, tca, tac, act, atc
Thanks for your help.
Those are permutations. Combinations would include ccc, ctt, aaa, acc...
There might be a formula solution to this but may require VBA. I can get back a little later today. Someone else may respond sooner.
I remembered that I played around with a workbook that someone attached at one time or another.
It was still hanging around on my computer so here is the code.
I am not the brain behind this so if you need changes made, you'll have to do it or someone else needs to jump in.
Jeff might come up with a better solution.
If you end up with doubles, let us know or use the code at the end. You can use that macro anyway as it does not do any harm if no doubles found.
All three go in a regular module and you call it with the "GetString" macro.
Please Login or Register to view this content.Please Login or Register to view this content.https://socratic.org/questions/how-d...ions-of-a-wordPlease Login or Register to view this content.
Last edited by jolivanes; 08-03-2022 at 12:09 PM. Reason: Added info
Experience trumps academics every day of the week and twice on Sunday.
Yes, this code works well. However, your words are not permitted duplicate letters.
I processed my own name 'stephen' and the output generated 2520 duplicates out of the total 5040.
Regards,
Stephen
If you change an "e" to an "x", do you still get duplicates?
No, if all letters are different the code works well - no duplicates.
There bound to be duplicates with the same letters.
See if you get any duplicates by using "EEEEEEE"
First, a Sub is provided to remove duplicates.
Seeing as though you are not the OP, we should find out if this solution meets the needs of this particular thread.
I would think the algorithm is correct.
With a word of 7 letters, 2 of which are the same, there are 7!/2! = 2520 possibilities.
Please note that the originator included this example - with duplicate l's. We await a response from him as to what is required.
Jeff
Re: "Seeing as though you are not the OP,"
I guess I better pay attention. Had not even noticed that.
Thank you all for your responses !
To answer this question, yes indeed it is possible to have a word with several times the same letter.
I want the permutations to give each time a word of the same size with the same letters but arranged in all possible combinations.
Thank you all for your help.
There are currently 1 users browsing this thread. (0 members and 1 guests)
Posting Permissions
LinkBack URL
About LinkBacks
Register To Reply
Bookmarks