Ransom note | Leetcode

Publicado el: 03 mayo 2020
en el canal de: Techdose

26,462

364

This video explains a very interesting string problem which is to find whether it is possible to form a ransom note using the characters of the string present in magazine. Characters are not reusable from magazine. I have explained this problem using hash which keeps count of frequency of characters in magazine and then try to form the ransom note using this frequency hash. If it is possible to form a string then we return true otherwise return false. I have explained this problem with proper example and intuition of how to solve it. I have also explained the CODE at the end of the video and have provided the CODE LINK below. This problem is based entirely on counting characters using an array or hashmap. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

CODE LINK: https://gist.github.com/SuryaPratapK/...

En esta página del sitio puede ver el video en línea Ransom note | Leetcode de Duración hora minuto segunda en buena calidad , que subió el usuario Techdose 03 mayo 2020, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 26,462 veces y le gustó 364 a los espectadores. Disfruta viendo!

286,747

2.7K