Posts

Showing posts from March, 2019

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); }

Hacker Rank- Staircase (Easy)

Link to code challenge function staircase(n) { let count = n - 1; for (let i = "#"; i.length Without creating a new variable: function staircase(n) { for (let i = "#"; i.length

Hacker Rank- Diagonal Difference (Easy)

Link to code challenge function diagonalDifference(arr) { console.log(arr); let sum1 = 0; let sum2 = 0; let j = 0; let k = arr.length - 1; for (let i = 0; i

Code Wars: Rot13 (5 kyu)

Link to code challenge function rot13(message){ let newString = ""; for (let char of message) { if ( char.match(/[a-z]/i) === null ) newString += char; else if ( char.charCodeAt() > 77 && char.charCodeAt() 109 && char.charCodeAt()

Code Wars: Fibonacci, Tribonacci and friends (6kyu)

Link to code challenge function Xbonacci(signature,n){ if (!signature.length) return []; let arr = [...signature.slice(0, n)]; const sumLength = signature.length; while (arr.length a + b); arr.push(sum); } return arr; }