Skip to content

Balloon string problem solution with several variations (progressions) and additional utilities added.

License

Notifications You must be signed in to change notification settings

8Altair/Balloon_problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Solution

A Java program to calculate the minimum number of balloons that can be used to spell the given word.

Description

The program takes a string as input and counts the number of occurrences of the letters B, A, L, O, and N. The letters L and O must be counted in pairs. The result is the minimum number of balloons that can be used to spell the given word.

Usage

The solution method takes a string S as input and returns an integer representing the minimum number of balloons needed to spell the word.

Requirements

The program requires Java 8 or higher.

Note

This program is a solution to a programming challenge and is meant for educational purposes only.

About

Balloon string problem solution with several variations (progressions) and additional utilities added.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages