45 Ransom Note

Asked in an Interview. 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. 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 #datastructures , #algorithms , #binarysearch , #RotatedArray, #sortingalgorithms , #SearchingAlgorithms, #Arrays, #LinkedLists, #Stacks, #Queues, #Trees, #BinaryTrees, #Graphs, #DynamicProgramming, #Recursion, #Hashing, #Heaps, #divideandconquer , #TwoPointerApproach, #SlidingWindowTechnique, #GreedyAlgorithms, #Backtracking, #GraphAlgorithms, #StringAlgorithms, #advanceddatastructures , #ComplexityAnalysis, #ProblemSolving, #InterviewPreparation, #geeksforgeeks , #FAANG, #MAANG, #leetcodechallenge, #blind75, #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa