HackerRank: Designer PDF Viewer (Easy)

Link to code challenge
function designerPdfViewer(h, word) { let max = 0; for (let i = 0; i < word.length; i++) { let numEq = word[i].charCodeAt() - 96 - 1; if (h[numEq] > max) max = h[numEq]; } return max * word.length; }

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: Replace With Alphabet Position

https://www.codewars.com/kata/546f922b54af40e1e90001da/train/javascript Welcome. In this kata you are required to, given a string, replace every letter with its position in the alphabet. If anything in the text isn't a letter, ignore it and don't return it. "a" = 1 ,  "b" = 2 , etc. Example alphabet_position( "The sunset sets at twelve o' clock." ) Should return  "20 8 5 19 21 14 19 5 20 19 5 20 19 1 20 20 23 5 12 22 5 15 3 12 15 3 11"  (as a string) function alphabetPosition(text) {   //split string into array of letters only   let sentence = text.toLowerCase().split("");   for (let i = sentence.length - 1; i >= 0; i--) {     if(sentence[i].match(/[a-z]/) === null) {       sentence.splice(i, 1);     }   }   //create an array of alphabets (97 represents lower case "a", 65 would be "A")   let alphaArr = [];   for (let i = 0; i < 26; i++) {     alpha...
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