Ransom Note
Problem
Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines ; otherwise, it will return false.
Each letter in the magazine string can only be used once in your ransom note.
Thought Process
Count the number of distinct characters appearing in the note
Solution
Time Complexity
Time: O(n)
Space: O(1) because hash set is bounded by 26 characters
Last updated