HackerRank- Mini-Max Sum (easy)

Link to code challenge
function miniMaxSum(arr) { let newArr = arr.sort((a, b) => a - b); let lowest = newArr.slice(0, newArr.length - 1).reduce((a, b) => a + b); let highest = newArr.slice(1).reduce((a,b) => a + b); console.log(lowest, highest); }

Comments

Post a Comment

Popular posts from this blog

Code Wars: String incrementer

https://www.codewars.com/kata/54a91a4883a7de5d7800009c/train/javascript Your job is to write a function which increments a string, to create a new string. If the string already ends with a number, the number should be incremented by 1. If the string does not end with a number the number 1 should be appended to the new string. Examples: foo -> foo1 foobar23 -> foobar24 foo0042 -> foo0043 foo9 -> foo10 foo099 -> foo100 Attention: If the number has leading zeros the amount of digits should be considered. My Solution:  function incrementString (strng) {   let regex = /[0-9]/g;   let index = strng.search(regex);   let arr = [];      //split string at where a number first appears   if (index === -1 || strng === "") {     return strng + "1";   }   else arr.push( strng.substring(0, index), strng.substring(index, strng.length) );      //loop through element of ...
Read more

Code Wars: Find the odd int

https://www.codewars.com/kata/54da5a58ea159efa38000836/train/javascript Given an array, find the int that appears an odd number of times. There will always be only one integer that appears an odd number of times. function findOdd(A) {   let arr = A.sort((a,b) => a - b);   let counter = 1;     if (arr.length === 1) return arr[0];     for (let i = 0; i < arr.length - 1; i++) {         if (arr[i] === arr[i + 1]) {       counter++;     }     else if (arr[i] !== arr[i + 1]) {             if (counter % 2 !== 0) {         return arr[i];       }       // if it turns out to be last number in array with a count of 1 (since for loop doesnt get to it)       else if (i + 1 === arr.length - 1) {         return arr[i + 1];       }       count...
Read more

Udemy JS Algorithms & Data Structures Masterclass- Section 6 Exercise 8 (1st try)

Sliding Window - minSubArrayLen Write a function called minSubArrayLen which accepts two parameters - an array of positive integers and a positive integer. This function should return the minimal length of a contiguous subarray of which the sum is greater than or equal to the integer passed to the function. If there isn't one, return 0 instead. My code efficiency: starts with shortest lengths first (then increments length by 1 each loop) so returns first one greater than or equal to integer. //loop thru array once and check if any element greater than or equal to integer- return 1 //loop thru array starting from each pointer, iterate to length of 2. If any summed to be greater than or equal to integer, return 2 //From each pointer, iterate to length of 3. If any summed to be greater or equal to integer, return 3. //... function minSubArrayLen(arr, num) { let pointer = 0; let currLength = 1; for (let i = pointer; i = num) return currLength; } curr...
Read more