Added README.md file for Self Dividing Numbers

Author: sanchitgd

728-self-dividing-numbers/README.md

@@ -0,0 +1,24 @@
+<h2><a href="https://leetcode.com/problems/self-dividing-numbers">Self Dividing Numbers</a></h2> <img src='https://img.shields.io/badge/Difficulty-Easy-brightgreen' alt='Difficulty: Easy' /><hr><p>A <strong>self-dividing number</strong> is a number that is divisible by every digit it contains.</p>
+
+<ul>
+<li>For example, <code>128</code> is <strong>a self-dividing number</strong> because <code>128 % 1 == 0</code>, <code>128 % 2 == 0</code>, and <code>128 % 8 == 0</code>.</li>
+</ul>
+
+<p>A <strong>self-dividing number</strong> is not allowed to contain the digit zero.</p>
+
+<p>Given two integers <code>left</code> and <code>right</code>, return <em>a list of all the <strong>self-dividing numbers</strong> in the range</em> <code>[left, right]</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<pre><strong>Input:</strong> left = 1, right = 22
+<strong>Output:</strong> [1,2,3,4,5,6,7,8,9,11,12,15,22]
+</pre><p><strong class="example">Example 2:</strong></p>
+<pre><strong>Input:</strong> left = 47, right = 85
+<strong>Output:</strong> [48,55,66,77]
+</pre>
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+<li><code>1 &lt;= left &lt;= right &lt;= 10<sup>4</sup></code></li>
+</ul>