-
Notifications
You must be signed in to change notification settings - Fork 0
/
test.js
215 lines (175 loc) · 5.91 KB
/
test.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
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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
var arrayErrorMessage = "Argument is not an array";
//************************ PROBLEM 1 ******************************/
function subArray(arr){
if(Array.isArray(arr)){
if(arr.length == 0 || arr.length == 1){
return arr;
}
let tmpArr = [];
let max = Number.NEGATIVE_INFINITY;
let result = [];
for(let i = 0; i < arr.length; i++){
if(max < arr[i]){
max = arr[i];
tmpArr.push(arr[i]);
}else{
tmpArr = [];
max = arr[i];
tmpArr.push(max);
}
if(tmpArr.length > result.length){
result = tmpArr;
}
}
return result;
}
return arrayErrorMessage;
}
let sumVar = [3, 2, 5, 9, 1, 3];
console.log("Printing example result of problem 1: " + subArray(sumVar));
console.log("Running unit test of problem 1....");
sumVar = [];
console.assert(subArray(sumVar).length == [].length);
sumVar = [3, 2, 5, 9, 1, 3];
console.assert(JSON.stringify(subArray(sumVar)) == JSON.stringify([2, 5, 9]));
sumVar = "1";
console.assert(subArray(sumVar) == arrayErrorMessage);
console.log("Finished unit test of problem 1");
//************************ PROBLEM 2 ******************************/
function recursiveSum(n, m){
if(n == m){
return n;
}
return n + recursiveSum(n + 1, m);
}
function iterativeSum(n, m){
if(m < 0 || n < 0){
return "m and n must be a positive numbers";
}
if(m < n){
return "M must be greater or equal than n";
}
let sum = 0;
if(n == m){
return n + m;
}
sum = n;
for(var i = n + 1; i <= m; i++){
sum += i;
}
return sum;
}
console.log("Problem 2 result recursive: " + recursiveSum(1, 10));
console.log("Problem 2 result iterative: " + iterativeSum(1, 10));
console.log("Running test of problem 2 recursive");
console.assert(55 == recursiveSum(1, 10));
console.log("Finished test of problem 2 recursive");
console.log("Running test of problem 2 iterative");
console.assert("m and n must be a positive numbers" == iterativeSum(-1, 0));
console.assert("m and n must be a positive numbers" == iterativeSum(0, -1));
console.assert("M must be greater or equal than n" == iterativeSum(5, 4));
console.assert(55 == iterativeSum(1, 10));
console.assert(55 == recursiveSum(1, 10));
console.log("Finished test of problem 2 iterative");
//************************ PROBLEM 3 ******************************/
var kPositiveError = "K must be a positive number";
var kZeroError = "K must be greater than zero";
function greaterNum(arr, k){
if(Array.isArray(arr) && !arr.some(isNaN)){
if(k < 0){
return kPositiveError;
}
if(k == 0){
return kZeroError;
}
if(arr.length == 1){
return arr[0];
}
arr.sort();
let count = 1;
let duplicated = -1;
for(let i = 0; i < arr.length; i++){
if(count == k){
return arr[i];
}else{
if(arr[i] == duplicated){
duplicated = arr[i];
}else{
count++;
}
}
}
//Case when the last number of the array is equals to the number of the position before that number, ej: [......5, 5];
return arr[i];
}
return "Arr must be an array of numbers";
}
var p3 = [4, 8, -1, 4, 3, 7, 8];
console.log("Running problem 3: " + greaterNum(p3, 2));
console.log("Starting tests problem 3...");
p3 = "a";
console.assert("Arr must be an array of numbers" == greaterNum(p3, 1));
p3 = [1]
console.assert(kPositiveError == greaterNum(p3, -1));
console.assert(kZeroError == greaterNum(p3, 0));
p3 = [3, 2, 1, 4, 5, 5];
console.assert(5 == greaterNum(p3, 5));
console.assert(5 == greaterNum(p3, 6));
console.log("Finished tests problem 3...");
//************************ PROBLEM 4 ******************************/
var p4NumericArrayError = "arr must be a numeric array";
function duplicatedItems(arr){
if(Array.isArray(arr) && !arr.some(isNaN)){
let result = [...new Set(arr)];
return result;
}
return p4NumericArrayError;
}
var p4 = [1, 1, 2, 3, 4];
console.log("Running problem 4: " + duplicatedItems(p4));
console.log("Running tests problem 4...");
console.assert(JSON.stringify(p4) == JSON.stringify([1, 1, 2, 3, 4]));
p4 = "a";
console.assert(p4NumericArrayError == duplicatedItems(p4));
p4 = ['a', 'b'];
console.assert(p4NumericArrayError == duplicatedItems(p4));
console.log("Finished tests problem 4");
//************************ PROBLEM 5 ******************************/
var p5ErrorMessage = "Argument must be an string";
function balancedArray(str){
if(typeof str == 'string'){
let strArr = Array.from(str);
let stack = [];
for(let i = 0; i < strArr.length; i++){
let tmpChar = strArr[i];
if(tmpChar == ')' || tmpChar == ']'){
let tmpStack = stack.pop();
if(tmpStack != '(' && tmpChar == ')'){
return false;
}else if(tmpStack != '[' && tmpChar == ']'){
return false;
}
}else{
stack.push(strArr[i]);
}
}
return stack.length == 0;
}
return p5ErrorMessage;
}
var p5 = ("([])");
console.log("Running problem 5: " + balancedArray(p5));
console.log("Starting tests problem 5...");
p5 = 1;
console.assert(p5ErrorMessage == balancedArray(p5));
p5 = "((((([[[[[]]]]])))))";
console.assert(true == balancedArray(p5));
p5 = "()[]()[]()";
console.assert(true == balancedArray(p5));
p5 = "[[[[[((((()))))]]]]]";
console.assert(true == balancedArray(p5));
p5 = "((((())))";
console.assert(false == balancedArray(p5));
p5 = "([)]";
console.assert(false == balancedArray(p5));
console.log("Finished tests problem 5...");