Merge pull request #174

add new approach for 76 problem 10.04

Author: Ashwagandha-coder

contest/src/main/java/com/github/contest/slidingWindow/SlidingWindowAlternativeSolution.kt

@@ -2,7 +2,8 @@ package com.github.contest.slidingWindow
 
 
 /**
- *
+ * 76. Minimum Window Substring
+ * Optimum Solution O(n + m)
  */
 
 fun minWindowOptimumSolution(s: String, t: String): String {
@@ -21,6 +22,7 @@ fun minWindowOptimumSolution(s: String, t: String): String {
     var formed = 0
     val windowCounts = mutableMapOf<Char, Int>()
 
+
     while (right < s.length) {
         val char = s[right]
         windowCounts[char] = windowCounts.getOrDefault(char, 0) + 1