[ Solution]1189. Maximum Number of Balloons
Problem Problem_Link Solutions (time, space) O(n), O(1) class Solution { public static int maxNumberOfBalloons(String text) { /* //for all alphabet characters int[] charList = new int[26]; for (char c : text.toChar...
Jul 27, 20221 min read26
![[ Solution]1189. Maximum Number of Balloons](/_next/image?url=https%3A%2F%2Fcdn.hashnode.com%2Fres%2Fhashnode%2Fimage%2Funsplash%2FnpxXWgQ33ZQ%2Fupload%2Fv1658954095945%2F1xTdH5LCH.jpeg&w=3840&q=75)
![[Solution] 2148. Count Elements With Strictly Smaller and Greater Elements](/_next/image?url=https%3A%2F%2Fcdn.hashnode.com%2Fres%2Fhashnode%2Fimage%2Funsplash%2FnpxXWgQ33ZQ%2Fupload%2Fv1658523940178%2Fi6PMXo4DUK.jpeg&w=3840&q=75)