aboutsummaryrefslogtreecommitdiff
path: root/challenge-276/deadmarshal/java
diff options
context:
space:
mode:
authorMohammad Sajid Anwar <Mohammad.Anwar@yahoo.com>2024-07-04 12:08:25 +0100
committerGitHub <noreply@github.com>2024-07-04 12:08:25 +0100
commit884c521c4a2d6bdd80eee7ff296ff6f2f235c349 (patch)
tree30c02d0f5cea0bcb5f306a383e52f2167a6a85b5 /challenge-276/deadmarshal/java
parent030a22e6dfd65db3b969a769d2981be9fbc6db8e (diff)
parent5d778b7b2bef2a6a478857b573d7796ffc214f77 (diff)
downloadperlweeklychallenge-club-884c521c4a2d6bdd80eee7ff296ff6f2f235c349.tar.gz
perlweeklychallenge-club-884c521c4a2d6bdd80eee7ff296ff6f2f235c349.tar.bz2
perlweeklychallenge-club-884c521c4a2d6bdd80eee7ff296ff6f2f235c349.zip
Merge pull request #10367 from deadmarshal/TWC276
TWC276
Diffstat (limited to 'challenge-276/deadmarshal/java')
-rw-r--r--challenge-276/deadmarshal/java/Ch1.java15
-rw-r--r--challenge-276/deadmarshal/java/Ch2.java18
2 files changed, 33 insertions, 0 deletions
diff --git a/challenge-276/deadmarshal/java/Ch1.java b/challenge-276/deadmarshal/java/Ch1.java
new file mode 100644
index 0000000000..ed0f616200
--- /dev/null
+++ b/challenge-276/deadmarshal/java/Ch1.java
@@ -0,0 +1,15 @@
+public class Ch1 {
+ public static void main(String[] args) {
+ System.out.println(complete_day(new int[]{12, 12, 30, 24, 24}));
+ System.out.println(complete_day(new int[]{72, 48, 24, 55}));
+ System.out.println(complete_day(new int[]{12, 18, 24}));
+ }
+
+ private static int complete_day(int[] arr) {
+ int count = 0;
+ for (int i = 0; i < arr.length - 1; ++i)
+ for (int j = i + 1; j < arr.length; ++j)
+ if ((arr[i] + arr[j]) % 24 == 0) count++;
+ return count;
+ }
+}
diff --git a/challenge-276/deadmarshal/java/Ch2.java b/challenge-276/deadmarshal/java/Ch2.java
new file mode 100644
index 0000000000..c8237e9f2b
--- /dev/null
+++ b/challenge-276/deadmarshal/java/Ch2.java
@@ -0,0 +1,18 @@
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.Map;
+
+public class Ch2 {
+ public static void main(String[] args) {
+ System.out.println(maximum_frequency(new int[]{1, 2, 2, 4, 1, 5}));
+ System.out.println(maximum_frequency(new int[]{1, 2, 3, 4, 5}));
+ }
+
+ private static int maximum_frequency(int[] arr) {
+ Map<Integer, Integer> hash = new HashMap<>();
+ for (int e : arr) hash.put(e, hash.getOrDefault(e, 0) + 1);
+ int max = Collections.max(hash.values());
+ return (int) hash.keySet().stream()
+ .filter(e -> hash.get(e) == max).count() * max;
+ }
+}