Add solution #1492

Author: JoshCrozier

README.md

@@ -171,6 +171,7 @@
 1475|[Final Prices With a Special Discount in a Shop](./1475-final-prices-with-a-special-discount-in-a-shop.js)|Easy|
 1480|[Running Sum of 1d Array](./1480-running-sum-of-1d-array.js)|Easy|
 1486|[XOR Operation in an Array](./1486-xor-operation-in-an-array.js)|Easy|
+1492|[The kth Factor of n](./1492-the-kth-factor-of-n.js)|Medium|
 1496|[Path Crossing](./1496-path-crossing.js)|Easy|
 1598|[Crawler Log Folder](./1598-crawler-log-folder.js)|Easy|
 1780|[Check if Number is a Sum of Powers of Three](./1780-check-if-number-is-a-sum-of-powers-of-three.js)|Medium|

solutions/1492-the-kth-factor-of-n.js

@@ -0,0 +1,27 @@
+/**
+ * 1492. The kth Factor of n
+ * https://leetcode.com/problems/the-kth-factor-of-n/
+ * Difficulty: Medium
+ *
+ * Given two positive integers n and k.
+ *
+ * A factor of an integer n is defined as an integer i where n % i == 0.
+ *
+ * Consider a list of all factors of n sorted in ascending order, return
+ * the kth factor in this list or return -1 if n has less than k factors.
+ */
+
+/**
+ * @param {number} n
+ * @param {number} k
+ * @return {number}
+ */
+var kthFactor = function(n, k) {
+  for (let i = 1; i <= n; i++) {
+    if (n % i === 0) {
+      k--;
+    }
+    if (!k) return i;
+  }
+  return -1;
+};