Merge pull request neetcode-gh#1443 from tharunkanna14/main

Create 1189-Maximum-Number-of-Balloons, Create 724-Find-Pivot-Index, Create 290-Word-Pattern

Author: Ahmad-A0

java/1189-Maximum-Number-of-Balloons

@@ -0,0 +1,33 @@
+class Solution {
+    public int maxNumberOfBalloons(String text) {
+        HashMap<Character, Integer> balloon = new HashMap<>();
+        HashMap<Character, Integer> countText = new HashMap<>();
+        
+        char[] balloonArray = "balloon".toCharArray();
+        
+        for (char c : balloonArray) {
+            if (balloon.containsKey(c)) {
+                balloon.put(c,balloon.get(c)+1);
+            } else {
+                balloon.put(c,1);
+            }
+        }
+        
+        char[] countTextArray = text.toCharArray();
+        
+        for (char c : countTextArray) {
+            if (countText.containsKey(c)) {
+                countText.put(c,countText.get(c)+1);
+            } else {
+                countText.put(c,1);
+            }
+        }
+        
+        int res = text.length();
+        for (Character c : balloon.keySet()) {
+            res = Math.min(res,countText.getOrDefault(c,0) / balloon.get(c));
+        }
+    
+        return res;
+    }
+}

java/290-word-pattern

@@ -0,0 +1,26 @@
+class Solution {
+    public boolean wordPattern(String pattern, String s) {
+        String[] sArray = s.split("\s");
+        if(sArray.length != pattern.length()) {
+            return false;
+        }
+        
+        HashMap<Character,String> charToWord = new HashMap<>();
+        HashMap<String,Character> wordToChar = new HashMap<>();
+        
+        for (int i = 0; i < pattern.length(); i++) {
+        
+            if(charToWord.containsKey(pattern.charAt(i)) && !charToWord.get(pattern.charAt(i)).equals(sArray[i])) {
+                return false;
+            }
+            
+            if(wordToChar.containsKey(sArray[i]) && !wordToChar.get(sArray[i]).equals(pattern.charAt(i))) {
+                return false;
+            }
+            
+            charToWord.put(pattern.charAt(i),sArray[i]);
+            wordToChar.put(sArray[i],pattern.charAt(i));
+        }
+        return true;    
+    }
+}

java/724-Find-Pivot-Index

@@ -0,0 +1,17 @@
+class Solution {
+    public int pivotIndex(int[] nums) {
+        int totalSum = 0;
+        for (int i = 0; i < nums.length; i++) {
+            totalSum += nums[i];
+        }
+        int leftSum = 0;
+        for (int i = 0; i < nums.length; i++) {
+            int rightSum = totalSum - leftSum - nums[i];
+            if (leftSum == rightSum) {
+                return i;
+            }
+            leftSum += nums[i];
+        }
+        return -1;
+    }
+}