We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Hash Tables: Ransom Note
  2. Discussions

Hash Tables: Ransom Note

Sort by

recency

|

1936 Discussions

|

  • learntoforget
     + 0 comments

    My soln. in C++

    void checkMagazine(vector magazine, vector note) {

    unordered_map<string, int> wordsMap;

for (const string& word : magazine){

    if (wordsMap.find(word) == wordsMap.end()) { //key not in map
        //create new entry
        wordsMap[word] = 1;

    } else {
        //increment entry
        wordsMap[word]++;
    }
}

for (const string& word : note) {
    //if word is not in map or count = 0, fail
    if (wordsMap.find(word) == wordsMap.end() || wordsMap[word] == 0) {

        std::cout << "No" << std::endl;
        return;
    } else { //else, continue and decrement entry

        wordsMap[word]--;
    }

}
std::cout << "Yes" << std::endl;

    }

  • berenicemcni
     + 0 comments
    def checkMagazine(magazine, note):
    result = 0
    word_dict = {}
    
    for i in range(len(magazine)):
      word_dict[magazine[i]] = word_dict.get(magazine[i], 0) + 1

    for word in note:
      word_dict[word] = word_dict.get(word, 0) - 1
      if word_dict[word] < 0:
          return print("No")
    
    print("Yes")

  • lylia_luong
     + 0 comments
    "def checkMagazine(magazine, note):
    count_mag = Counter(magazine)
    count_note = Counter(note)
    
    for word in count_note.keys(): 
        if word not in count_mag.keys() or count_note[word] > count_mag[word]:
            print(""No"")
            return 
    print(""Yes"")
"

  • wubrafiqcse807
     + 0 comments

    Java:

    public static void checkMagazine(List<String> magazine, List<String> note) {
        // Write your code here
        Map<String, Integer> map = new HashMap<>();
        Map<String, Integer> noteMap = new HashMap<>();
        for(String str: magazine) {
            if(map.containsKey(str)) map.put(str, map.get(str)+1);
            else map.put(str, 1);
        }
        for(String str: note) {
            if(noteMap.containsKey(str)) noteMap.put(str, noteMap.get(str)+1);
            else noteMap.put(str, 1);
        }
        String ans ="Yes";
        for (Map.Entry<String, Integer> set:noteMap.entrySet()) {
            if(!map.containsKey(set.getKey()) ||
                    (map.containsKey(set.getKey()) && map.get(set.getKey())<noteMap.get(set.getKey()))) {
                ans = "No";
            }
        }
        System.out.println(ans);

    }

  • pierbus_dev
     + 0 comments

    ts

    function checkMagazine(magazine: string[], note: string[]): void {
    if(magazine.length < note.length){
        console.log("No")
        return
    }
        
    const magazineMap = new Map<string, number>()
    magazine.forEach( (magazineWord) => {
        const value = magazineMap.get(magazineWord) ? magazineMap.get(magazineWord) + 1 : 1
        magazineMap.set(magazineWord, value)
    })
    
    for(const word of note){
        if(!magazineMap.has(word)){
            console.log("No")
            return
        }
        const currentValue = magazineMap.get(word)
        if(currentValue - 1 === 0){
            magazineMap.delete(word)
        }else {
            magazineMap.set(word, currentValue -1)
        }
    }
    console.log("Yes")
}