{"id":1332,"date":"2022-09-06T13:08:21","date_gmt":"2022-09-06T11:08:21","guid":{"rendered":"https:\/\/fileidea.com\/?p=1332"},"modified":"2022-09-06T13:13:44","modified_gmt":"2022-09-06T11:13:44","slug":"leetcode-ransom-note","status":"publish","type":"post","link":"https:\/\/fileidea.com\/2022\/09\/06\/leetcode-ransom-note\/","title":{"rendered":"LeetCode – Ransom Note"},"content":{"rendered":"\n

Given two strings ransomNote<\/code> and magazine<\/code>, return true<\/code> if <\/em>ransomNote<\/code> can be constructed by using the letters from <\/em>magazine<\/code> and <\/em>false<\/code> otherwise<\/em>.
Each letter in magazine<\/code> can only be used once in ransomNote<\/code>.<\/p>LeetCode problem 383<\/cite><\/blockquote>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> ransomNote = \"a\", magazine = \"b\"\nOutput:<\/strong> false\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> ransomNote = \"aa\", magazine = \"ab\"\nOutput:<\/strong> false\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> ransomNote = \"aa\", magazine = \"aab\"\nOutput:<\/strong> true<\/pre>\n\n\n\n
This problem is very straight forward. We have a bunch of letters that we can use to create our ransomNote. One way would be to use a List to store the magazine and check if the character exists in our list, and remove each magazine character after each ransom character. However, that would be bad if we had a lot of character in our list. <\/p>\n\n\n\n
If we would use a HashMap, or Dictionary in C#, then we could store how many times the character appear instead.<\/p>\n\n\n\n
First of all, we initialize two Dictionaries<\/p>\n\n\n\n
    Dictionary<char, int> magazineChars = new Dictionary<char, int>();\n    Dictionary<char, int> ransomChars = new Dictionary<char, int>();<\/code><\/pre>\n\n\n\n
Let’s store our characters in each of the Dicitionaries:<\/p>\n\n\n\n
    for (int i = 0; i < magazine.Length; i++)\n    {\n        if (magazineChars.ContainsKey(magazine[i]))\n        {\n            magazineChars[magazine[i]]++;\n        }\n        else\n        {\n            magazineChars.Add(magazine[i], 1);\n        }\n    }\n    for (int i = 0; i < ransomNote.Length; i++)\n    {\n        if (ransomChars.ContainsKey(ransomNote[i]))\n        {\n            ransomChars[ransomNote[i]]++;\n        }\n        else\n        {\n            ransomChars.Add(ransomNote[i], 1);\n        }\n    }<\/code><\/pre>\n\n\n\n
Then we proceed to go through the characters which is our Key, from our ransom Dictionary:<\/p>\n\n\n\n
        foreach(char c in ransomChars.Keys) {\n            if(!magazineChars.ContainsKey(c)) {\n                return false;\n            }\n            if(magazineChars[c] < ransomChars[c]) {\n                return false;\n            }\n        }<\/code><\/pre>\n\n\n\n
What is good here is that we only go through the list of our ransom and do constant lookup and check their values if there is less amount of characters of c<\/em> as in our magazine Dictionary. If there is less of a character in the magazine Dicitonary than in our ransom, that means we can’t create our ransom note, and the result is therefore false<\/strong>. If we have enough characters, we proceed. Full code below.<\/p>\n\n\n\n
public class Solution {\n    public bool CanConstruct(string ransomNote, string magazine) {\n        Dictionary<char, int> magazineChars = new Dictionary<char, int>();\n        Dictionary<char, int> ransomChars = new Dictionary<char, int>();\n        \n        for(int i = 0; i < magazine.Length; i++) {\n            if(magazineChars.ContainsKey(magazine[i])) {\n                magazineChars[magazine[i]]++;\n            } else {\n                magazineChars.Add(magazine[i], 1);\n            }\n        }\n\n        for(int i = 0; i < ransomNote.Length; i++) {\n            if(ransomChars.ContainsKey(ransomNote[i])) {\n                ransomChars[ransomNote[i]]++;\n            } else {\n                ransomChars.Add(ransomNote[i], 1);\n            }\n        }\n        \n        foreach(char c in ransomChars.Keys) {\n            if(!magazineChars.ContainsKey(c)) {\n                return false;\n            }\n            if(magazineChars[c] < ransomChars[c]) {\n                return false;\n            }\n        }\n         \n        return true;\n    }\n}<\/code><\/pre>\n\n\n\n
<\/p>\n","protected":false},"excerpt":{"rendered":"
Given two strings 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. LeetCode problem 383 Example 1: Input: ransomNote = “a”, magazine = “b” Output: false Example 2: Input: ransomNote = “aa”, magazine = “ab” Output: false Example 3: Input: ransomNote = “aa”, magazine = “aab” Output: true This … <\/p>\n
Continue reading “LeetCode – Ransom Note”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[40,105],"tags":[109,110,111],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/fileidea.com\/wp-json\/wp\/v2\/posts\/1332"}],"collection":[{"href":"https:\/\/fileidea.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/fileidea.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/fileidea.com\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/fileidea.com\/wp-json\/wp\/v2\/comments?post=1332"}],"version-history":[{"count":10,"href":"https:\/\/fileidea.com\/wp-json\/wp\/v2\/posts\/1332\/revisions"}],"predecessor-version":[{"id":1343,"href":"https:\/\/fileidea.com\/wp-json\/wp\/v2\/posts\/1332\/revisions\/1343"}],"wp:attachment":[{"href":"https:\/\/fileidea.com\/wp-json\/wp\/v2\/media?parent=1332"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fileidea.com\/wp-json\/wp\/v2\/categories?post=1332"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fileidea.com\/wp-json\/wp\/v2\/tags?post=1332"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}