bloomer1
diff --git a/‎README.md
Lines changed: 1 addition & 0 deletions b/‎README.md
Lines changed: 1 addition & 0 deletions
diff --git a/‎src/main/java/com/stevesun/solutions/_567.java
Lines changed: 54 additions & 0 deletions b/‎src/main/java/com/stevesun/solutions/_567.java
Lines changed: 54 additions & 0 deletions
diff --git a/‎src/test/java/com/stevesun/_567Test.java
Lines changed: 32 additions & 0 deletions b/‎src/test/java/com/stevesun/_567Test.java
Lines changed: 32 additions & 0 deletions
@@ -20,6 +20,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Difficulty  | Tag          | Notes
 |-----|----------------|---------------|---------------|---------------|-------------|--------------|-----
+|567|[Permutation in String](https://leetcode.com/problems/permutation-in-string/)|[Solution](../master/src/main/java/com/stevesun/solutions/_567.java) | O(max(m,n)) |O(1) | Medium | Sliding Windows, Two Pointers
 |566|[Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix/)|[Solution](../master/src/main/java/com/stevesun/solutions/_566.java) | O(m*n) |O(1) | Easy | 
 |563|[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/)|[Solution](../master/src/main/java/com/stevesun/solutions/_563.java) | O(n) |O(n) | Easy | Tree Recursion
 |562|[Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/)|[Solution](../master/src/main/java/com/stevesun/solutions/_562.java) | O(m*n) |O(m*n) | Medium | Matrix DP
 
@@ -0,0 +1,54 @@
+package com.stevesun.solutions;
+
+/**
+ * Given two strings s1 and s2, write a function to return true if s2 contains the permutation of s1.
+ * In other words, one of the first string's permutations is the substring of the second string.
+
+ Example 1:
+ Input:s1 = "ab" s2 = "eidbaooo"
+ Output:True
+ Explanation: s2 contains one permutation of s1 ("ba").
+
+ Example 2:
+ Input:s1= "ab" s2 = "eidboaoo"
+ Output: False
+
+ Note:
+ The input strings only contain lower case letters.
+ The length of both given strings is in range [1, 10,000].
+ */
+public class _567 {
+
+    //credit: sliding window: https://discuss.leetcode.com/topic/87845/java-solution-sliding-window
+    public boolean checkInclusion(String s1, String s2) {
+        int len1 = s1.length();
+        int len2 = s2.length();
+        if (len1 > len2) return false;
+
+        int[] count = new int[26];
+        for (int i = 0; i < len1; i++) {
+            count[s1.charAt(i) - 'a']++;
+        }
+
+        for (int i = 0; i < len1; i++) {
+            count[s2.charAt(i) - 'a']--;
+        }
+
+        if (allZeroes(count)) return true;
+
+        for (int i = len1; i < len2; i++) {
+            count[s2.charAt(i) - 'a']--;
+            count[s2.charAt(i - len1) - 'a']++;
+            if (allZeroes(count)) return true;
+        }
+
+        return false;
+    }
+
+    private boolean allZeroes(int[] count) {
+        for (int i : count) {
+            if (i != 0) return false;
+        }
+        return true;
+    }
+}
@@ -0,0 +1,32 @@
+package com.stevesun;
+
+import com.stevesun.solutions._567;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+/**
+ * Created by stevesun on 4/30/17.
+ */
+public class _567Test {
+    private static _567 test;
+    private static boolean expected;
+    private static boolean actual;
+    private static String s1;
+    private static String s2;
+
+    @BeforeClass
+    public static void setup(){
+        test = new _567();
+    }
+
+    @Test
+    public void test1(){
+        s1 = "ab";
+        s2 = "eidbaooo";
+        expected = true;
+        actual = test.checkInclusion(s1, s2);
+        assertEquals(expected, actual);
+    }
+}