aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorKai Burgdorf <k@iburgdorf.de>2024-07-04 22:51:29 +0200
committerKai Burgdorf <k@iburgdorf.de>2024-07-04 22:51:29 +0200
commitbc48ef30568e657ce12798e6542cf91cc6bc4ecf (patch)
tree5ced047dfed51b7c2189ad7a554edc3adc543838
parent8aaf8e15d880c3d35c93fc522d5112b7151c9f4a (diff)
downloadperlweeklychallenge-club-bc48ef30568e657ce12798e6542cf91cc6bc4ecf.tar.gz
perlweeklychallenge-club-bc48ef30568e657ce12798e6542cf91cc6bc4ecf.tar.bz2
perlweeklychallenge-club-bc48ef30568e657ce12798e6542cf91cc6bc4ecf.zip
ch-2 js solution
-rw-r--r--challenge-276/kai-burgdorf/javascript/ch-2.js18
1 files changed, 18 insertions, 0 deletions
diff --git a/challenge-276/kai-burgdorf/javascript/ch-2.js b/challenge-276/kai-burgdorf/javascript/ch-2.js
new file mode 100644
index 0000000000..735773bf1e
--- /dev/null
+++ b/challenge-276/kai-burgdorf/javascript/ch-2.js
@@ -0,0 +1,18 @@
+const ints = [1, 2, 2, 4, 1, 5];
+//const ints = [1, 2, 3, 4, 5];
+
+
+var frequencies = {};
+var highest = 0;
+var total = 0;
+
+ints.forEach((curInt, i) => {
+ frequencies[curInt] = (frequencies[""+curInt] === undefined) ? 1 : frequencies[""+curInt]+1;
+ if(frequencies[""+curInt] > highest) highest=frequencies[""+curInt];
+});
+
+(new Set(ints)).forEach((curInt, i) => {
+ if(frequencies[""+curInt] === highest) total+=frequencies[""+curInt];
+});
+
+console.log("Output: " + total);