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?

Printable View

- Dec 13th 2011, 05:32 AMjashansinghalnumber of permutations
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? - Dec 13th 2011, 06:26 AMPlatoRe: number of permutations