1181. Before and After Puzzle

What if you check every pair of strings (bruteforce)?

For every two strings, check if they can form a puzzle by comparing their last and first words.