Add solution #728

Author: JoshCrozier

README.md

@@ -551,6 +551,7 @@
 724|[Find Pivot Index](./0724-find-pivot-index.js)|Easy|
 725|[Split Linked List in Parts](./0725-split-linked-list-in-parts.js)|Medium|
 726|[Number of Atoms](./0726-number-of-atoms.js)|Hard|
+728|[Self Dividing Numbers](./0728-self-dividing-numbers.js)|Easy|
 733|[Flood Fill](./0733-flood-fill.js)|Easy|
 735|[Asteroid Collision](./0735-asteroid-collision.js)|Medium|
 739|[Daily Temperatures](./0739-daily-temperatures.js)|Medium|

solutions/0728-self-dividing-numbers.js

@@ -0,0 +1,24 @@
+/**
+ * 728. Self Dividing Numbers
+ * https://leetcode.com/problems/self-dividing-numbers/
+ * Difficulty: Easy
+ *
+ * A self-dividing number is a number that is divisible by every digit it contains.
+ * - For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0,
+ *   and 128 % 8 == 0.
+ *
+ * A self-dividing number is not allowed to contain the digit zero.
+ *
+ * Given two integers left and right, return a list of all the self-dividing numbers
+ * in the range [left, right] (both inclusive).
+ */
+
+/**
+ * @param {number} left
+ * @param {number} right
+ * @return {number[]}
+ */
+var selfDividingNumbers = function(left, right) {
+  return Array.from({ length: right - left + 1 }, (_, i) => left + i)
+    .filter(n => String(n).split('').every(d => d !== '0' && n % d === 0));
+};