Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1897 with 18 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1897 # by problem number
lcpy gen -s redistribute_characters_to_make_all_strings_equal # by problem name
words (0-indexed).
In one operation, pick two distinct indices i and j, where words[i] is a non-empty string, and move any character from words[i] to any position in words[j].
Return true if you can make every string in words equal using any number of operations, and false otherwise.
Input: words = ["abc","aabc","bc"]
Output: true
Explanation: Move the first 'a' in words[1] to the front of words[2],
to make words[1] = "abc" and words[2] = "abc".
All the strings are now equal to "abc", so return true.
Input: words = ["ab","a"]
Output: false
Explanation: It is impossible to make all the strings equal using the operation.
from collections import Counter
class Solution:
# Time: O(total characters)
# Space: O(1) (at most 26 keys)
def make_equal(self, words: list[str]) -> bool:
n = len(words)
counts: Counter[str] = Counter()
for word in words:
counts.update(word)
return all(count % n == 0 for count in counts.values())
| Time | Space |
|---|---|
| O(total characters) | O(1) (at most 26 keys) |