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 1160 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1160 # by problem number
lcpy gen -s find_words_that_can_be_formed_by_characters # by problem name
words and a string chars.
A string is good if it can be formed by characters from chars (each character can only be used once for each word in words).
Return the sum of lengths of all good strings in words.
Input: words = ["cat","bt","hat","tree"], chars = "atach"
Output: 6
Explanation: The strings that can be formed are "cat" and "hat" so the answer is 3 + 3 = 6.
Input: words = ["hello","world","leetcode"], chars = "welldonehoneyr"
Output: 10
Explanation: The strings that can be formed are "hello" and "world" so the answer is 5 + 5 = 10.
1 <= words.length <= 10001 <= words[i].length, chars.length <= 100words[i] and chars consist of lowercase English letters.from collections import Counter
class Solution:
# Time: O(sum(len(w) for w in words) + len(chars))
# Space: O(1)
def count_characters(self, words: list[str], chars: str) -> int:
chars_count = Counter(chars)
return sum(len(word) for word in words if not (Counter(word) - chars_count))
| Time | Space |
|---|---|
| O(sum(len(w) for w in words) + len(chars)) | O(1) |