-
Notifications
You must be signed in to change notification settings - Fork 0
/
2024-01-06 Codewars 7 Kyu Fundamentals - Find the Middle Element.js
47 lines (32 loc) · 1.49 KB
/
2024-01-06 Codewars 7 Kyu Fundamentals - Find the Middle Element.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
// 1/6/24 Saturday Codewars 7 Kyu Fundamentals - Find the Middle Element
// https://www.codewars.com/kata/545a4c5a61aa4c6916000755/train/javascript
/*
As a part of this Kata, you need to create a function that when provided with a triplet, returns the index of the numerical element that lies between the other two elements.
The input to the function will be an array of three distinct numbers (Haskell: a tuple).
For example:
gimme([2, 3, 1]) => 0
2 is the number that fits between 1 and 3 and the index of 2 in the input array is 0.
Another example (just to make sure it is clear):
gimme([5, 10, 14]) => 1
10 is the number that fits between 5 and 14 and the index of 10 in the input array is 1.
*/
function gimme (triplet) {
if( (triplet[0] < triplet[1] && triplet[0] > triplet[2]) || (triplet[0] > triplet[1] && triplet[0] < triplet[2]) ) {
return 0;
} else if( (triplet[1] < triplet[0] && triplet[1] > triplet[2]) || (triplet[1] > triplet[0] && triplet[1] < triplet[2]) ) {
return 1;
} else if( (triplet[2] < triplet[0] && triplet[2] > triplet[1]) || (triplet[2] > triplet[0] && triplet[2] < triplet[1]) ) {
return 2;
}
}
/* =============
Other Solutions
============= */
function gimme(a) {
return a.indexOf(a.concat().sort(function(a, b) { return a - b })[1])
}
// concat() duplicates the input array, which must be done since sort() modifies it
// Other solution #2
const gimme = function (arr) {
return arr.indexOf([...arr].sort((x, y) => x > y)[1]);
};