fix: repo placement

src/_Problems_/k-largest-in-array/index.js → src/_DataStructures_/Heaps/k-largest-in-array/index.js

@@ -1,4 +1,4 @@
-const MaxHeap = require('../../_DataStructures_/Heaps/MaxHeap');
+const MaxHeap = require('../MaxHeap');
 
 /**
  * Find the 4 largest elements from an array

src/_DataStructures_/Heaps/k-smallest-in-array/index.js

@@ -0,0 +1,21 @@
+/**
+ * Find 4 smallest elements in an array
+ */
+
+const MinHeap = require('../MinHeap');
+
+function findKSmallest(collection, k) {
+  if (!collection || !Array.isArray(collection)) {
+    throw new Error('Invalid / missing collection');
+  }
+
+  // create a MinHeap using the collection
+  const mh = new MinHeap(collection);
+  const result = [];
+  for (let i = 0; i < k; i += 1) {
+    result.push(mh.getMin());
+  }
+  return result;
+}
+
+module.exports = findKSmallest;

src/_DataStructures_/k-largest-in-array/index.js

@@ -0,0 +1,22 @@
+const MaxHeap = require('../MaxHeap');
+
+/**
+ * Find the 4 largest elements from an array
+ */
+
+function findKLargest(collection, k) {
+  if (!collection || !Array.isArray(collection)) {
+    throw new Error('Invalid / missing collection');
+  }
+
+  // create a MaxHeap using the collection
+  const mh = new MaxHeap(collection);
+  const result = [];
+
+  for (let i = 0; i < k; i += 1) {
+    result.push(mh.getMax());
+  }
+  return result;
+}
+
+module.exports = findKLargest;

src/_Problems_/k-smallest-in-array/index.js

@@ -2,7 +2,7 @@
  * Find 4 smallest elements in an array
  */
 
-const MinHeap = require('../../_DataStructures_/Heaps/MinHeap');
+const MinHeap = require('../MinHeap');
 
 function findKSmallest(collection, k) {
   if (!collection || !Array.isArray(collection)) {