Added more solutions inside hard category

kanahaiya · kanahaiya · commit f0f162ecb1c0 · 2018-04-02T00:03:46.000+05:30
diff --git a/LeetCodeSolutions/HardLevelSolutions/.classpath b/LeetCodeSolutions/HardLevelSolutions/.classpath
@@ -12,7 +12,7 @@
 			<attribute name="maven.pomderived" value="true"/>
 		</attributes>
 	</classpathentry>
-	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/J2SE-1.5">
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-1.8">
 		<attributes>
 			<attribute name="maven.pomderived" value="true"/>
 		</attributes>
diff --git a/LeetCodeSolutions/HardLevelSolutions/.settings/org.eclipse.jdt.core.prefs b/LeetCodeSolutions/HardLevelSolutions/.settings/org.eclipse.jdt.core.prefs
@@ -1,8 +1,8 @@
 eclipse.preferences.version=1
 org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
-org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.5
-org.eclipse.jdt.core.compiler.compliance=1.5
+org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.8
+org.eclipse.jdt.core.compiler.compliance=1.8
 org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
 org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
 org.eclipse.jdt.core.compiler.problem.forbiddenReference=warning
-org.eclipse.jdt.core.compiler.source=1.5
+org.eclipse.jdt.core.compiler.source=1.8
diff --git a/LeetCodeSolutions/HardLevelSolutions/pom.xml b/LeetCodeSolutions/HardLevelSolutions/pom.xml
@@ -7,9 +7,7 @@
     <artifactId>LeetCodeSolutions</artifactId>
     <version>0.0.1-SNAPSHOT</version>
   </parent>
-  <groupId>com.javaaid.leetcode</groupId>
   <artifactId>HardLevelSolutions</artifactId>
-  <version>0.0.1-SNAPSHOT</version>
   <name>HardLevelSolutions</name>
   <url>http://maven.apache.org</url>
   <properties>
diff --git a/LeetCodeSolutions/HardLevelSolutions/src/main/java/com/javaaid/solutions/hard/heaps/SlidingWindowMaximum.java b/LeetCodeSolutions/HardLevelSolutions/src/main/java/com/javaaid/solutions/hard/heaps/SlidingWindowMaximum.java
@@ -0,0 +1,37 @@
+/**
+ * 
+ */
+package com.javaaid.solutions.hard.heaps;
+
+import java.util.ArrayDeque;
+import java.util.Arrays;
+import java.util.Deque;
+
+/**
+ * @author Kanahaiya Gupta
+ *
+ */
+public class SlidingWindowMaximum {
+
+	public static int[] maxSlidingWindow(int[] nums, int k) {
+		if (nums.length == 0 || nums == null || k == 0)
+			return new int[0];
+
+		int result[] = new int[nums.length - k + 1];
+		Deque<Integer> window = new ArrayDeque<Integer>();
+		int m = 0;
+		for (int i = 0; i < nums.length; i++) {
+			while (!window.isEmpty() && nums[window.peekLast()] < nums[i]) {
+				window.pollLast();
+			}
+			while (!window.isEmpty() && window.peek() < i - k + 1) {
+				window.poll();
+			}
+			window.offer(i);
+			if (i >= k - 1) {
+				result[m++] = nums[window.peek()];
+			}
+		}
+		return result;
+	}
+}
diff --git a/LeetCodeSolutions/HardLevelSolutions/src/main/java/com/javaaid/solutions/hard/twopointer/MinimumWindowSubstring.java b/LeetCodeSolutions/HardLevelSolutions/src/main/java/com/javaaid/solutions/hard/twopointer/MinimumWindowSubstring.java
@@ -0,0 +1,49 @@
+/**
+ * 
+ */
+package com.javaaid.solutions.hard.twopointer;
+
+import java.util.HashMap;
+
+/**
+ * @author Kanahaiya Gupta
+ *
+ */
+public class MinimumWindowSubstring {
+
+	public String minWindow(String s, String t) {
+		HashMap<Character, Integer> hmap = new HashMap<Character, Integer>();
+
+		for (char ch : t.toCharArray()) {
+			hmap.put(ch, hmap.getOrDefault(ch, 0) + 1);
+		}
+		int counter = hmap.size();
+		int begin = 0, end = 0, len = Integer.MAX_VALUE;
+		String ans = "";
+		while (end < s.length()) {
+			char endChar = s.charAt(end);
+			Integer count = hmap.get(endChar);
+			if (count != null) {
+				hmap.put(endChar, count - 1);
+				if (hmap.get(endChar) == 0)
+					counter--;
+			}
+			end++;
+
+			while (counter == 0) {
+				char c = s.charAt(begin);
+				if (hmap.get(c) != null) {
+					hmap.put(c, hmap.get(c) + 1);
+					if (hmap.get(c) > 0)
+						counter++;
+				}
+				if (end - begin < len) {
+					len = end - begin;
+					ans = s.substring(begin, begin + len);
+				}
+				begin++;
+			}
+		}
+		return ans;
+	}
+}
