-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathConsonant value.js
More file actions
33 lines (25 loc) · 1.06 KB
/
Consonant value.js
File metadata and controls
33 lines (25 loc) · 1.06 KB
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
/* Given a lowercase string that has alphabetic characters only and no spaces, return the highest value of consonant substrings. Consonants are any letters of the alphabet except "aeiou".
We shall assign the following values: a = 1, b = 2, c = 3, .... z = 26.
For example, for the word "zodiacs", let's cross out the vowels. We get: "z o d ia cs"
-- The consonant substrings are: "z", "d" and "cs" and the values are z = 26, d = 4 and cs = 3 + 19 = 22. The highest is 26.
solve("zodiacs") = 26
For the word "strength", solve("strength") = 57
-- The consonant substrings are: "str" and "ngth" with values "str" = 19 + 20 + 18 = 57 and "ngth" = 14 + 7 + 20 + 8 = 49. The highest is 57.
For C: do not mutate input.
More examples in test cases. Good luck! */
function solve(s) {
s = s
.split(new RegExp('[aioeu]'))
.filter((l) => l)
.map((l) => {
l = l.split('')
let sum = 0
l.forEach((l) => {
sum += l.charCodeAt(0) - 96
})
return sum
})
return Math.max(...s)
}
console.log(solve('zodiacs'))
console.log(solve('strength'))