-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsubmission.js
More file actions
127 lines (79 loc) · 2.3 KB
/
submission.js
File metadata and controls
127 lines (79 loc) · 2.3 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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
const findSum = function(array) {
// your code here - don't forget to return a number!
let ans = array.reduce(function(sum,num){
return sum + num;
}, 0);
return ans;
};
const findFrequency = function(array) {
// your code here - don't forget to return an object!
let maxLetter = '';
let maxCount = 0;
let minLetter = '';
let minCount = 1;
let count = array.reduce(function(accumulator, letter){
if (!(letter in accumulator)){
accumulator[letter] = 1;
} else{
accumulator[letter] ++;
};
if (accumulator[letter] > maxCount){
maxCount = accumulator[letter];
maxLetter = letter;
};
if (accumulator[letter] <= minCount){
minCount = accumulator[letter];
minLetter = letter;
};
return ({'most':maxLetter, 'least':minLetter});
},{});
return count;
};
const isPalindrome = function(str) {
// your code here - don't forget to return a boolean!
var reverse = str.split('').reverse().join('');
if (str == reverse){
return true;
} else{
return false;
};
};
const largestPair = function(array) {
// your code here - don't forget to return a number!
let index = 1;
let ans = array.reduce(function(product,num){
if (num * array[index] > product && index < array.length){
product = num * array[index];
}
index ++;
return product
},0);
return ans;
};
const removeParenth = function(str) {
// your code here - don't forget to return a string!
let strArray = str.split('');
let firstIndex = 0;
let secondIndex = 0;
for (let index = 0; index < strArray.length; index++) {
if (strArray[index] === '('){
firstIndex = index;
}
if (strArray[index] === ')'){
secondIndex = index + 1;
};
};
strArray.splice(firstIndex,(secondIndex - firstIndex));
return strArray.join('');
}
const scoreScrabble = function(str) {
// your code here - don't forget to return a number!
let scores = {
'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
};
let word = str.split('');
let score = word.reduce(function(sum,letter){
return sum + scores[letter];
},0);
return score;
};