ME

Count Complementary Pairs

Given an array of strings, find the number of complementary pairs that can be formed. A complementary pair is defined as two strings that can be concatenated and rearranged to form a palindrome.

Example 1:

Input:[["ball","all","call","bal"]]

Output:3

Example 2:

Input:[["abc","abcd","bc","adc"]]

Output:3

Constraints:

1 ≤ n ≤ 10^5
1 ≤ length(stringData[i]) ≤ 3 * 10^5
1 ≤ sum of the length of strings in stringData ≤ 3 * 10^5

solution.cpp

Loading...

Run code to see test results

00:00 / 69:42

Count Complementary Pairs

MediumMed•1,595 views

Given an array of strings, find the number of complementary pairs that can be formed. A complementary pair is defined as two strings that can be concatenated and rearranged to form a palindrome.