Initial commit

Author: Michaeldremy

.gitattributes

@@ -0,0 +1,2 @@
+# Auto detect text files and perform LF normalization
+* text=auto

Mini_MaxSum.js

@@ -0,0 +1,48 @@
+// https://www.hackerrank.com/challenges/mini-max-sum/problem?h_r=next-challenge&h_v=zen&h_r=next-challenge&h_v=zen
+
+[1,3,5,7,9,10,11,12]
+
+function miniMaxSum(arr) {
+    let minSum = 0;
+    let maxSum = 0;
+
+    arr = arr.sort()
+    for(let i = 0; i < arr.length - 1; i ++) {
+        minSum += arr[i];
+    }
+    for (let j = 1; j < arr.length; j++) {
+        maxSum += arr[j];
+    }
+
+    console.log(minSum, maxSum);
+}
+
+miniMaxSum([1,2,3,4,5])
+miniMaxSum([7, 69, 2, 221, 8974])
+
+
+
+
+
+function miniMaxSum(arr) {
+  let sum = 0;
+  let min = arr[0];
+  let max = arr[0];
+  for(let i = 0; i < 5; i ++) {
+      sum += arr[i];
+  }
+  for(let i of arr){
+    if(i < min){
+      min = i;
+    }
+    if(i > max){
+      max = i;
+    }
+  }
+  let minSum = sum - max;
+  let maxSum = sum - min;
+  console.log(minSum, maxSum);
+}
+
+miniMaxSum([1,2,3,4,5])
+miniMaxSum([7, 69, 2, 221, 8974])

PlusMinus.js

@@ -0,0 +1,20 @@
+function plusMinus1(arr){
+    let pos = 0;
+    let neg = 0;
+    let zero = 0;
+    for(let i of arr){ 
+        if(i > 0){
+            pos ++;
+        }
+        else if(i < 0){
+            neg++;
+        }
+        else{
+            zero++;
+        }
+    }
+    console.log(pos/arr.length);
+    console.log(neg/arr.length);
+    console.log(zero/arr.length);
+}
+console.log(plusMinus1([-4,3,-9,0,4,1]))

README.md

@@ -0,0 +1,2 @@
+# HackerRank-Algos
+ Algorithms off of HackerRank

Staircase.js

@@ -0,0 +1,25 @@
+// https://www.hackerrank.com/challenges/staircase/problem?h_r=next-challenge&h_v=zen
+
+function staircase(n){
+    let filledArray = new Array(n).fill(' ');
+        while (filledArray.indexOf(' ') !== -1) { 
+            filledArray.shift();
+            filledArray.push('#');
+            console.log(filledArray.join(""));
+            n--;
+    }
+}
+
+
+function staircase1(n){
+    let newArr = [];
+    for(let i=0; i< n; i++){
+        newArr.push(' ');
+    }
+    for(let i=0; i< n; i++){
+        newArr.shift();
+        newArr.push('#');
+        console.log(newArr.join(''));
+    }
+}
+staircase1(6);

TimeConversion.js

@@ -0,0 +1,32 @@
+// https://www.hackerrank.com/challenges/time-conversion/problem?h_r=next-challenge&h_v=zen&h_r=next-challenge&h_v=zen&h_r=next-challenge&h_v=zen&h_r=next-challenge&h_v=zen
+
+// 12:40:22AM
+// 00:40:22
+
+// 06:40:03AM
+// 06:40:03
+
+function timeConversion(s){
+  let newTime;
+  let hour = 0;
+  let sec = "";
+  let splitStr = s.split(":");
+  if (s[8] === "P"){
+    hour = parseInt(splitStr[0]) + 12;
+    sec = splitStr[2].split("P")[0];
+    if(hour === 24){
+      hour = "12";
+    }
+  }
+  else {
+    hour = splitStr[0];
+    sec = splitStr[2].split("A")[0];
+    if(hour === "12"){
+      hour = "00";
+    }
+  }
+  newTime = hour + ":" + splitStr[1] + ":"+ sec;
+  return newTime;
+}
+
+console.log(timeConversion('12:40:22AM'));    

appleAndOrange.js

@@ -0,0 +1,29 @@
+// https://www.hackerrank.com/challenges/apple-and-orange/problem?h_r=next-challenge&h_v=zen
+
+function countAppleAndOranges(s, t, a, b, apples, oranges) {
+  let applesArr = [];
+  let orangesArr = [];
+  let countApples = 0;
+  let countOranges = 0;
+    for(let i of apples){
+        applesArr.push(i+a);
+    }
+    for(let i of oranges){
+        orangesArr.push(i+b);
+    }
+    for (let i of applesArr){
+        if(i >= s && i <= t){
+            countApples++;
+        }
+    }
+    for (let i of orangesArr){
+        if(i >= s && i <= t){
+            countOranges++;
+        }
+      }
+      console.log(countApples);
+      console.log(countOranges);
+    return [countApples, countOranges];
+}
+
+console.log(countAppleAndOranges(7,11,5,15,[-2,2,1],[5,-6]));

birthDayCake.js

@@ -0,0 +1,19 @@
+// https://www.hackerrank.com/challenges/birthday-cake-candles/problem?h_r=next-challenge&h_v=zen&h_r=next-challenge&h_v=zen&h_r=next-challenge&h_v=zen
+
+function birthdayCakeCandles(ar) {
+    let max = 0;
+    let height = 0;
+    for (let i = 0; i < ar.length; i++) {
+        if (ar[i] > max) {
+            max = ar[i];
+        }
+        for (let j = 0; j < ar.length; j++) {
+        }
+        if (ar[j] === max) {
+            height++;
+        }
+    }
+    return height;
+}
+
+console.log(birthdayCakeCandles([3,2,1,3]));

diagonalDifference.js

@@ -0,0 +1,27 @@
+function diagonalDifference(arr) {
+    if(arr.length !== arr[0].length){
+        return null;
+    }
+    let firstDiagonal = 0;
+    let secondDiagonal = 0;
+    const squareRowCol = arr.length -1;
+    for(let i = 0; i <= squareRowCol; i++){
+        firstDiagonal += arr[i][i];
+        if(i === squareRowCol){
+            secondDiagonal += arr[0][i];
+        }
+        else if(i <= Math.floor(arr.length/2) && i !== 0){
+            secondDiagonal += arr[squareRowCol-i][i];
+        }
+        else if(i > Math.floor(arr.length/2) && i !== squareRowCol){
+            secondDiagonal += arr[squareRowCol-i][i];
+        }
+        else{
+            secondDiagonal += arr[squareRowCol][0];
+        }
+    }
+    let result = Math.abs(firstDiagonal - secondDiagonal);
+    return result;
+}
+
+console.log(diagonalDifference([[1,2,3,4,5],[1,2,3,4,5],[1,2,3,4,5],[1,2,3,4,5],[1,2,3,4,5]]));

gradingStudents.js

@@ -0,0 +1,24 @@
+// https://www.hackerrank.com/challenges/grading/problem
+
+// any grade less than for 40 is a failing grade
+
+function gradingStudents(grades) {
+    let difference = 0;
+    let newArr = [];
+    
+    for (let i = 0; i < grades.length; i++) {
+        difference = 5 - grades[i] %5;
+        if(grades[i] < 38){
+            newArr.push(grades[i]);
+        }
+        else if(difference < 3){
+            newArr.push(grades[i] + difference)
+        }
+        else{
+            newArr.push(grades[i]);
+        }
+    console.log(newArr[i])
+    }
+    return newArr;
+}
+gradingStudents([73,67,38,33]);