You are given a list of cities, where each city is represented as a 3-character lowercase string. Two cities are directly connected if they differ in exactly one character position.

Given a startCity and an endCity, find the minimum number of hops to travel from startCity to endCity through the network of connected cities. Return -1 if endCity is not reachable from startCity. ...