Filters all self-dividing numbers

34th exercise - leetcode.com/problems/self-dividing-numbers/
CharlesCreativeContent · Jun 28, 2020 · beb3b0f · beb3b0f
1 parent b808bb2
commit beb3b0f
Showing 1 changed file with 26 additions and 0 deletions.
diff --git a/self-dividingNumbers.js b/self-dividingNumbers.js
@@ -0,0 +1,26 @@
+/*
+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.
+
+Also, a self-dividing number is not allowed to contain the digit zero.
+
+Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.
+
+Example 1:
+Input: 
+left = 1, right = 22
+Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
+*/
+
+//Answer//
+
+/**
+ * @param {number} left
+ * @param {number} right
+ * @return {number[]}
+ */
+var selfDividingNumbers = function(left, right) {
+return Array(right-(left-1)).fill(0).map((_,i)=>i+left).filter(x=>String(x).split('').map(Number).every(y=>x%y===0))
+
+};