Create README - LeetHub

Author: JanaSabuj

permutation-in-string/README.md

@@ -0,0 +1,25 @@
+<h2>567. Permutation in String</h2><h3>Medium</h3><hr><div><p>Given two strings <b>s1</b> and <b>s2</b>, write a function to return true if <b>s2</b> contains the permutation of <b>s1</b>. In other words, one of the first string's permutations is the <b>substring</b> of the second string.</p>
+
+<p>&nbsp;</p>
+
+<p><b>Example 1:</b></p>
+
+<pre><b>Input: </b>s1 = "ab" s2 = "eidbaooo"
+<b>Output: </b>True
+<b>Explanation:</b> s2 contains one permutation of s1 ("ba").
+</pre>
+
+<p><b>Example 2:</b></p>
+
+<pre><b>Input:</b>s1= "ab" s2 = "eidboaoo"
+<b>Output:</b> False
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li>The input strings only contain lower case letters.</li>
+	<li>The length of both given strings is in range [1, 10,000].</li>
+</ul>
+</div>