Leetcode 383. Ransom Note | Hindi | Python | Leetcode | Optimized way
#leetcode #python #timecomplexity
Q. 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
Solution -
Optimized way - Note - this is sample code.. we cannot use angle brackets in description, so I removed them from the code.
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) - bool:
d = {}
t = ransomNote
s = magazine
for i in s:
if i not in d:
d[i] = 1
else:
d[i] += 1
for j in t:
if j not in d:
return False
d[j] -= 1
if d[j] == -1:
return False
return True
#python #leetcodesolutions #dsa #pythoninterviewquestions
Python Developer Interview Questions Answers
Top 10 Python Developer Interview Questions Answer
Mostly asked Python Developer Interview Questions Answer
Commonly asked Python Developer Interview Questions Answer
Tags -
Python leetcode problems
leetcode two sum
leetcode solutions
leetcode hindi
two sum python
two sum problem
Nesta página do site você pode assistir ao vídeo on-line Leetcode 383. Ransom Note | Hindi | Python | Leetcode | Optimized way duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário DataEngineering360 30 Novembro 2025, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 44 vezes e gostou 0 espectadores. Boa visualização!
