Skip to content

Commit 561e393

Browse files
committed
Create README - LeetHub
1 parent 406efff commit 561e393

File tree

1 file changed

+27
-0
lines changed

1 file changed

+27
-0
lines changed

0567-permutation-in-string/README.md

+27
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
<h2><a href="https://leetcode.com/problems/permutation-in-string">567. Permutation in String</a></h2><h3>Medium</h3><hr><p>Given two strings <code>s1</code> and <code>s2</code>, return <code>true</code><em> if </em><code>s2</code><em> contains a permutation of </em><code>s1</code><em>, or </em><code>false</code><em> otherwise</em>.</p>
2+
3+
<p>In other words, return <code>true</code> if one of <code>s1</code>&#39;s permutations is the substring of <code>s2</code>.</p>
4+
5+
<p>&nbsp;</p>
6+
<p><strong class="example">Example 1:</strong></p>
7+
8+
<pre>
9+
<strong>Input:</strong> s1 = &quot;ab&quot;, s2 = &quot;eidbaooo&quot;
10+
<strong>Output:</strong> true
11+
<strong>Explanation:</strong> s2 contains one permutation of s1 (&quot;ba&quot;).
12+
</pre>
13+
14+
<p><strong class="example">Example 2:</strong></p>
15+
16+
<pre>
17+
<strong>Input:</strong> s1 = &quot;ab&quot;, s2 = &quot;eidboaoo&quot;
18+
<strong>Output:</strong> false
19+
</pre>
20+
21+
<p>&nbsp;</p>
22+
<p><strong>Constraints:</strong></p>
23+
24+
<ul>
25+
<li><code>1 &lt;= s1.length, s2.length &lt;= 10<sup>4</sup></code></li>
26+
<li><code>s1</code> and <code>s2</code> consist of lowercase English letters.</li>
27+
</ul>

0 commit comments

Comments
 (0)