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 383 with 11 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 383 # by problem number
lcpy gen -s ransom_note # by problem name
ransomNote and magazine, return true if ransomNote can be constructed by using the letters from magazine and false otherwise.
Each letter in magazine can only be used once in ransomNote.
Input: ransomNote = "a", magazine = "b"
Output: false
Input: ransomNote = "aa", magazine = "ab"
Output: false
Input: ransomNote = "aa", magazine = "aab"
Output: true
from collections import Counter
class Solution:
# Time: O(m + n) where m = magazine length, n = ransom_note length
# Space: O(1) - at most 26 lowercase letters
def can_construct(self, ransom_note: str, magazine: str) -> bool:
if len(ransom_note) > len(magazine):
return False
magazine_count = Counter(magazine)
for char in ransom_note:
if magazine_count[char] == 0:
return False
magazine_count[char] -= 1
return True
| Time | Space |
|---|---|
| O(m + n) where m = magazine length, n = ransom_note length | O(1) - at most 26 lowercase letters |