Ransom Note #383| Leetcode | May LeetCoding Challenge

preview_player
Показать описание
Ransom Note (LeetCode) solution, this problem is posted as Day 3 problem of May LeetCoding Challenge on LeetCode.
Explained the algorithm with O(n+m) complexity.
This question is very commonly asked in Programming Interview.

#LeetCode
#ProblemSolving
Author : Shahrukh Khan
Links
Рекомендации по теме
Комментарии
Автор

sir, we can use dictionary over array they take less memory ?.. because if we can only store only those characters which are present in magzine Note? .. as KEY["character"] = value[no. of occurrence of character in magine]

kunalsoni
join shbcf.ru