There is a game I played a lot in school. The game is called first letter, last letter. The object of this game is for one player to say a word apple
, and for the other player to say a word that begins with the last letter of the previous word, i.e. elephant
.
Using the following selection of English Pokemon names, generate a sequence with the highest possible number of Pokemon names where the subsequent name starts with the final letter of the previous name.
Note that names cannot be repeated.
Please write a function Sequence(words []string) []string
.
go test -bench .