-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday_43.js
34 lines (27 loc) · 1015 Bytes
/
day_43.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
// // Highest Scoring Word
// // Given a string of words, you need to find the highest scoring word.
// // Each letter of a word scores points according to its position in the alphabet: a = 1, b = 2, c = 3 etc.
// // You need to return the highest scoring word as a string.
// // If two words score the same, return the word that appears earliest in the original string.
// // All letters will be lowercase and all inputs will be valid.
// CHALLENGES (0/2 DONE)
// high('man i need a taxi up to ubud') should return 'taxi'
// high('what time are we climbing up the volcano') should return 'volcano'
function high(x) {
//code your magic here
x = x.split(' ')
let theWord = ''
let max = 0;
x.map((ele) => {
let score = 0
for(let i=0;i<ele.length;i++){
score += ele.charCodeAt(i)- 96
if(score > max) {
max = score
theWord = ele
}
}
})
return theWord
}
console.log(high('what time are we climbing up the volcano'));