Consider the word HONOLULU. Find all 8 letter words that can be formed using all the letters if no 2 alike letters are adjacent.
What is the shortest method to do this?
Consider the word HONOLULU. Find all 8 letter words that can be formed using all the letters if no 2 alike letters are adjacent. What is the shortest method to do this?
The bad news is that there is no shortest way.
Using inclusion/exclusion find the number if ways that at least one pair is adjacent to one another. Subtract from the total.