Ransom Note
Beginner
Return True if you can build the string note using letters cut from magazine, where each letter of the magazine can be used at most once. Otherwise return False.
Examples
Example 1
Input:
ransom_note('aab', 'baa')
Output:
True
Example 2
Input:
ransom_note('aa', 'ab')
Output:
False
Constraints
0 <= len(note), len(magazine) <= 3 * 10**5- Both strings contain lower-case letters.
Theory
Go to TheoryKeywords
dsa-sheethashingcounting-with-dictionaries
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.