Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3042. Count Prefix and Suffix Pairs I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source