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 1002 with 12 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1002 # by problem number
lcpy gen -s find_common_characters # by problem name
words, return an array of all characters that show up in all strings within the words (including duplicates). You may return the answer in any order.
Input: words = ["bella","label","roller"]
Output: ["e","l","l"]
Input: words = ["cool","lock","cook"]
Output: ["c","o"]
1 <= words.length <= 1001 <= words[i].length <= 100words[i] consists of lowercase English letters.from collections import Counter
class Solution:
# Time: O(sum len(words))
# Space: O(1) for the counter (26 letters)
def common_chars(self, words: list[str]) -> list[str]:
common = Counter(words[0])
for word in words[1:]:
common &= Counter(word)
return list(common.elements())
| Time | Space |
|---|---|
| O(sum len(words)) | O(1) for the counter (26 letters) |