Update MinimumWindowSubstring.java

Author: Anubhav-pandey004

src/main/java/com/thealgorithms/slidingwindow/MinimumWindowSubstring.java

@@ -25,15 +25,21 @@ private MinimumWindowSubstring() {
      * @return the minimum sum of the subarray of size k
      */
  public static String minWindow(String s, String t) {
-        if (s.length() < t.length()) return "";
+        if (s.length() < t.length())
+        {
+            return "";
+        }
 
         HashMap<Character, Integer> tFreq = new HashMap<>();
         for (char c : t.toCharArray()) {
             tFreq.put(c, tFreq.getOrDefault(c, 0) + 1);
         }
 
         HashMap<Character, Integer> windowFreq = new HashMap<>();
-        int left = 0, right = 0, minLen = Integer.MAX_VALUE, count = 0;
+        int left = 0;
+        int right = 0; 
+        int minLen = Integer.MAX_VALUE;
+        int count = 0;
         String result = "";
 
         while (right < s.length()) {
@@ -43,7 +49,6 @@ public static String minWindow(String s, String t) {
             if (tFreq.containsKey(c) && windowFreq.get(c).intValue() <= tFreq.get(c).intValue()) {
                 count++;
             }
-
             while (count == t.length()) {
                 if (right - left + 1 < minLen) {
                     minLen = right - left + 1;
@@ -52,7 +57,6 @@ public static String minWindow(String s, String t) {
 
                 char leftChar = s.charAt(left);
                 windowFreq.put(leftChar, windowFreq.get(leftChar) - 1);
-                
                 if (tFreq.containsKey(leftChar) && windowFreq.get(leftChar) < tFreq.get(leftChar)) {
                     count--;
                 }