Word Chain — Solution & Editorial

Back to the Problem

Compare last/first letters of each adjacent pair.

Complexity: O(length)