LeetCode Ransom Note

LeetCode Ransom Note

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.

You may assume that both strings contain only lowercase letters.

canConstruct("a", "b") -> false
canConstruct("aa", "ab") -> false
canConstruct("aa", "aab") -> true


class Solution {
	bool canConstruct(string ransomNote, string magazine) {
		unordered_map<char, int> hash;
		for (int i = 0; i < magazine.size(); i++) {
		for (int i = 0; i < ransomNote.size(); i++) {
			if (hash[ransomNote[i]] < 0)return false;
		return true;


Leave a Reply

Your email address will not be published. Required fields are marked *