Merge branch 'main' of https://github.com/modavidc/hackerrank-algorithms-javascript

Author: modavidc

Diff for: README.md

@@ -16,7 +16,7 @@
 </p>
 
 <p align="center">
-  This repository contains solutions to the<strong>Hackerrank</strong> practice algorithms, using <strong>Javascript</strong>.
+  This repository contains solutions to the <strong>Hackerrank</strong> practice algorithms, using <strong>Javascript</strong>.
   <br />
   <br />
   Take a look, play and have fun with this.

Diff for: arrays/arrays-ds.js

@@ -1,17 +1,32 @@
 // Problem: https://www.hackerrank.com/challenges/arrays-ds/problem
 
-function reverseArray(a) {
-    return a.reverse();
+/**
+ * Reverse an array of integers.
+ *
+ * @param {array} numbersArray an array of integers.
+ *
+ * @notes The reverse() function of the Javascript API is used.
+ */
+function reverseArray(numbersArray) {
+  return numbersArray.reverse();
 }
 
-function reverseArray2(a) {
-    let reversedArray = [];
+/**
+ * Reverse an array of integers.
+ *
+ * @param {array} numbersArray an array of integers.
+ *
+ * @notes The for loop is used.
+ */
+function reverseArrayAlternative(numbersArray) {
+  let reversedArray = [];
 
-    for (let i = a.length - 1; i >= 0; i--) {
-        reversedArray.push(a[i]);
-    }
-    
-    return reversedArray;
+  for (let i = numbersArray.length - 1; i >= 0; i--) {
+    reversedArray.push(numbersArray[i]);
+  }
+
+  return reversedArray;
 }
 
-console.log(reverseArray2([1, 4, 3, 2]));
+console.log(reverseArray([1, 4, 3, 2]));
+console.log(reverseArrayAlternative([1, 4, 3, 2]));

Diff for: warmup/solve-me-first.js

@@ -0,0 +1,5 @@
+// Problem: https://www.hackerrank.com/challenges/solve-me-first/problem
+
+function solveMeFirst(a, b) {
+  return a + b;
+}