Daily challenge for 2026-09-16
624. Equivalent Character Sets
Given an array of strings words, return the number of pairs (i, j) such that i < j and words[i] and words[j] contain the exact same set of unique characters.
Example:Input: {"words": ["aab", "ba", "abc", "cba"]}Output: 2
Explanation: The pairs are (0, 1) since both "aab" and "ba" have the unique characters 'a' and 'b', and (2, 3) since both "abc" and "cba" have the unique characters 'a', 'b', and 'c'.
Run this challenge interactively in Python or JavaScript when the app loads.