LeetCode 1189. Maximum Number of Balloons (Solution Explained)

preview_player
Показать описание


Preparing For Your Coding Interviews? Use These Resources
————————————————————

Other Social Media
----------------------------------------------

Show Support
------------------------------------------------------------------------------

#coding #programming #softwareengineering
Рекомендации по теме
Комментарии
Автор

nice solution. was doing one with hashmap then saw your way and realized it was so easy and didn't need to complicate it,

HiBMlive
Автор

That was like pathologically multifarious math problem that could get across pretty sophisticatedly . But there is one precocious one we can also come up with,
The approach is —
We gonna make up new variable(string) = balloon and push them off to hashset that we build up as well as we ultimately build up HashMap and populate the occurrences of frequency based on “text” and then as well basically bang away with Entry statement in HashMap, we can carry out this solution pretty pragmatically with min-freq

NEO-wlox
Автор

Thanks for these videos
Don't stop!

f-faithfitnessfinance
Автор

It's ok to go slow, because who want's fast can watch the video at 1.2x or 1.5x, which I do most.

jugsma
Автор

Let me use my first language to praise u: 🐂🍺

shunyihuang
Автор

There is no need to create array of size 26 u can create only 5 for handling b a l o n

narendratechguy
Автор

you are draining my confidence by saying it to easy😆😆😆😆

swacharahman