-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsubmission.js
More file actions
108 lines (65 loc) · 1.86 KB
/
submission.js
File metadata and controls
108 lines (65 loc) · 1.86 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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
const findSum = function(array) {
let total = 0;
for (let value of array) {
total += value;
}
return total;
}
const findFrequency = function(array) {
const obj = {};
let max = 0;
let min = 0;
let mostFreq = null;
let leastFreq = null;
for (let i=0; i < array.length; i++) {
let letter = array[i];
if (obj[letter]) {
obj[letter]++;
} else {
obj[letter] = 1;
}
}
for (let x in obj) {
if (obj[x] > max){
max = obj[x];
mostFreq = x;
}
}
for (let x in obj) {
if (obj[x] < max) {
min = obj[x];
leastFreq = x;
}
}
return {
'most': mostFreq,
'least': leastFreq
};
}
const isPalindrome = function(str) {
var smallStr = str.toLowerCase();
var reversed = smallStr.split("").reverse().join("");
if (reversed === smallStr) return true;
return false
}
const largestPair = function(array) {
let largestProduct = array[0] * array[1];
let i;
for (i = 0; i < array.length; i++) {
if ((array[i] * array[i+1]) > largestProduct) {
largestProduct = array[i] * array[i+1]
}
}
return largestProduct;
}
const removeParenth = function(str) {
let newPhrase = str.replace("(","").replace(")","");
return newPhrase;
}
const scoreScrabble = function(str) {
let scoreBoard = {a:1, e:1, i:1, o:1, u:1, l:1, n:1, r:1, s:1, t:1, d:2, g:2, b:3, c:3, m:3, p:3, f:4, h:4, v:4, w:4, y:4, k:5, j:8, x:8, q:10, z:10}, wordScore = 0, i;
for (i = 0; i < str.length; i++) {
wordScore += scoreBoard[str[i]];
}
return wordScore;
}