213. Word Chain Validator

Write a function solve that checks if a list of words can form a valid chain. In a word chain, each word must start with the last letter of the previous word (case insensitive).

Example:
Input: ["apple", "elephant", "tiger", "rabbit"]
Output: True

Run this challenge interactively in Python or JavaScript when the app loads.