diff --git a/771-jewels-and-stones/README.md b/771-jewels-and-stones/README.md
new file mode 100644
index 0000000..e13bd9a
--- /dev/null
+++ b/771-jewels-and-stones/README.md
@@ -0,0 +1,21 @@
+<h2><a href="https://leetcode.com/problems/jewels-and-stones/">771. Jewels and Stones</a></h2><h3>Easy</h3><hr><div><p>You're given strings <code>jewels</code> representing the types of stones that are jewels, and <code>stones</code> representing the stones you have. Each character in <code>stones</code> is a type of stone you have. You want to know how many of the stones you have are also jewels.</p>
+
+<p>Letters are case sensitive, so <code>"a"</code> is considered a different type of stone from <code>"A"</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<pre><strong>Input:</strong> jewels = "aA", stones = "aAAbbbb"
+<strong>Output:</strong> 3
+</pre><p><strong class="example">Example 2:</strong></p>
+<pre><strong>Input:</strong> jewels = "z", stones = "ZZ"
+<strong>Output:</strong> 0
+</pre>
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;=&nbsp;jewels.length, stones.length &lt;= 50</code></li>
+	<li><code>jewels</code> and <code>stones</code> consist of only English letters.</li>
+	<li>All the characters of&nbsp;<code>jewels</code> are <strong>unique</strong>.</li>
+</ul>
+</div>
\ No newline at end of file