Leetcode 3045. Count Prefix and Suffix Pairs II

Count pairs (i < j) where words[i] is both a prefix and a suffix of words[j]. With up to 5e5 total characters, the challenge is to avoid quadratic pairwise checks and use efficient string-matching or grouping by word/length (e.g., hashing/trie/KMP) to count matches.