TWC276 raku and d solutions

2 files changed, 37 insertions, 0 deletions

diff --git a/challenge-276/deadmarshal/d/ch1.d b/challenge-276/deadmarshal/d/ch1.d
new file mode 100644
index 0000000000..6ccb6559d0
--- /dev/null
+++ b/challenge-276/deadmarshal/d/ch1.d
@@ -0,0 +1,18 @@
+import std.stdio:writeln;
+
+int complete_day(int[] arr)
+{
+  int count = 0;
+  foreach(i;0..arr.length-1)
+    foreach(j;i+1..arr.length)
+      if((arr[i] + arr[j]) % 24 == 0) count++;
+  return count;
+}
+
+void main()
+{
+  writeln(complete_day([12,12,30,24,24]));
+  writeln(complete_day([72,48,24,55]));
+  writeln(complete_day([12,18,24]));
+}
+
diff --git a/challenge-276/deadmarshal/d/ch2.d b/challenge-276/deadmarshal/d/ch2.d
new file mode 100644
index 0000000000..dcbf95de1f
--- /dev/null
+++ b/challenge-276/deadmarshal/d/ch2.d
@@ -0,0 +1,19 @@
+import std.stdio:writeln;
+import std.algorithm:maxElement,filter,sum;
+import std.array:array;
+
+int maximum_frequency(int[] arr)
+{
+  int sum = 0;
+  int[int] h;
+  foreach(e;arr) h[e]++;
+  int max = h.values.maxElement;
+  return h.values.filter!(a => a == max).array.sum;
+}
+
+void main()
+{
+  writeln(maximum_frequency([1,2,2,4,1,5]));
+  writeln(maximum_frequency([1,2,3,4,5]));
+}
+