Balloon Everywhere GeeksforGeeks POTD 10 Feb | C++ Solution|
**************************
#potd #gfg #geeksforgeeks #balloon #ballooneverywhere
Hello Guys
Welcome to my YouTube Channel
Subscribe and click the bell icon to get notified.: http://bit.ly/_mahaveerYT
In this video we will be solving the POTD i.e. Problem of the day from the geeksforgeeks website.
Problem link:
https://practice.geeksforgeeks.org/pr...
Problem Code Github Link:
https://github.com/codewithgfg/GFG-PO...
Problem Statement = Bob is very fond of balloons. Once he visited an amusement park with his mother. The mother told Bob that she would buy him a balloon only if he answer her problem right. She gave Bob a string S [contains only lowercase characters] and asked him to use the characters of string to form as many instances of the word "balloon" as possible. Return the maximum number of instances that can be formed.
Help Bob to solve the problem.
Note: You can use each character in the string at most once.
You can contact me here:
Instagram :
/ _mahaveer_18
Thanks for watching.
Please like, share and subscribe.
**************************
#c++Solutions #coding #programming #wave #gfgproblem #gfgproblemoftheday #10febgfg #dailysolutiongfg #potd #potdgfg #ballongfg #balloneverywhere #ballooneverywhere #ballooneverywheregfg #10febballoonproblemgfg
#array #programming #gfg #geeksforgeeks #problem #potd #coding #dsa #leetcode #balloon #ballooneverywhere #podtproblem