I am going to try and explain this as best I can.
I have 9 values i need to compare. They each contain a string of numbers from 1-9. So 123, 1234, 1345, 14689 and so on. They will never contain more of the same number, and will always be from lowest to highest. I need to compare value one to the other values, then value 2 against the other values, then value 3 and 4 all the way to 9. there will be 9 total. I need it to count how many of each character from a certain value, can be found in each of the other values.
So far I think i have the logic down, but I don't know an efficient way to code it.
Compare 257 against 35678
They both have a 5, and a 7. This is a match.
Bookmarks