Maximum Number of Balloons — LeetCode
Written by Stephanie Segura | May 15, 2021
Thank you for visiting this post! Be sure to also take a look at my other work on LinkedIn, Github, and my website.
Please click the link below to view the Problem Statement
Maximum Number of Balloons - LeetCode
Given a string text, you want to use the characters of text to form as many instances of the word "balloon" as…
The static function
Math.min()returns the lowest-valued number passed into it, or
NaNif any parameter isn't a number and can't be converted into one.
— MDN Web Docs
I put comments next to each line of code in the gist above to explain what is happening step by step.
Thank you so much for stopping by! Stay tuned for more Algorithm Content. Java Style!
Please checkout my online portfolio and feel free to connect with me on Linkedin!
Stephanie Segura - Lone Star College - Houston, Texas, United States | LinkedIn
Hi there! My name is Stephanie. I am a Full-Stack Software Engineer residing in Houston, TX. Building on my business…