Leetcode 3042. Count Prefix and Suffix Pairs I

Count the number of index pairs (i < j) such that words[i] is both a prefix and a suffix of words[j] (i.e., words[j] starts and ends with words[i]). With n ≤ 50 and word length ≤ 10, this can be solved directly by pairwise string comparisons.