383. Ransom Note - LeetCode Solution


String Hash Table

Python Code:

class Solution:
    def canConstruct(self, ransomNote: str, magazine: str) -> bool:
        dic1 = {}
        dic2 ={}
        
        for i in range(len(ransomNote)):
            if ransomNote[i] in dic1:
                dic1[ransomNote[i]] +=1 
            else:
                dic1[ransomNote[i]] = 1
        
        for i in range(len(magazine)):
            if magazine[i] in dic2:
                dic2[magazine[i]] +=1
            else:
                dic2[magazine[i]] = 1
        
        for i in dic1:
            if i in dic2:
                if dic1[i]<=dic2[i]:
                    continue
                else:
                    return False
            else:
                return False
        return True
                


Comments

Submit
0 Comments
More Questions

1630C - Paint the Middle
1630D - Flipping Range
1328A - Divisibility Problem
339A - Helpful Maths
4A - Watermelon
476A - Dreamoon and Stairs
1409A - Yet Another Two Integers Problem
977A - Wrong Subtraction
263A - Beautiful Matrix
180C - Letter
151A - Soft Drinking
1352A - Sum of Round Numbers
281A - Word Capitalization
1646A - Square Counting
266A - Stones on the Table
61A - Ultra-Fast Mathematician
148A - Insomnia cure
1650A - Deletions of Two Adjacent Letters
1512A - Spy Detected
282A - Bit++
69A - Young Physicist
1651A - Playoff
734A - Anton and Danik
1300B - Assigning to Classes
1647A - Madoka and Math Dad
710A - King Moves
1131A - Sea Battle
118A - String Task
236A - Boy or Girl
271A - Beautiful Year