From de605ab5d0b5839224d64aadaac2499ec0e4d9b1 Mon Sep 17 00:00:00 2001
From: Ali <adeadmarshal@gmail.com>
Date: Wed, 17 Sep 2025 07:27:19 +0330
Subject: TWC339

---
 challenge-339/deadmarshal/java/Ch1.java | 17 +++++++++++++++++
 challenge-339/deadmarshal/java/Ch2.java | 21 +++++++++++++++++++++
 2 files changed, 38 insertions(+)
 create mode 100644 challenge-339/deadmarshal/java/Ch1.java
 create mode 100644 challenge-339/deadmarshal/java/Ch2.java

(limited to 'challenge-339/deadmarshal/java')

diff --git a/challenge-339/deadmarshal/java/Ch1.java b/challenge-339/deadmarshal/java/Ch1.java
new file mode 100644
index 0000000000..c2b5bf781c
--- /dev/null
+++ b/challenge-339/deadmarshal/java/Ch1.java
@@ -0,0 +1,17 @@
+import java.util.Arrays;
+
+public class Ch1 {
+  public static void main(String[] args) {
+    System.out.println(max_diff(new int[] { 5, 9, 3, 4, 6 }));
+    System.out.println(max_diff(new int[] { 1, -2, 3, -4 }));
+    System.out.println(max_diff(new int[] { -3, -1, -2, -4 }));
+    System.out.println(max_diff(new int[] { 10, 2, 0, 5, 1 }));
+    System.out.println(max_diff(new int[] { 7, 8, 9, 10, 10 }));
+  }
+
+  private static int max_diff(int[] arr) {
+    Arrays.sort(arr);
+    final int n = arr.length;
+    return arr[n - 1] * arr[n - 2] - arr[0] * arr[1];
+  }
+}
diff --git a/challenge-339/deadmarshal/java/Ch2.java b/challenge-339/deadmarshal/java/Ch2.java
new file mode 100644
index 0000000000..22d7449bd0
--- /dev/null
+++ b/challenge-339/deadmarshal/java/Ch2.java
@@ -0,0 +1,21 @@
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
+public class Ch2 {
+  public static void main(String[] args) {
+    System.out.println(peak_point(new int[] { -5, 1, 5, -9, 2 }));
+    System.out.println(peak_point(new int[] { 10, 10, 10, -25 }));
+    System.out.println(peak_point(new int[] { 3, -4, 2, 5, -6, 1 }));
+    System.out.println(peak_point(new int[] { -1, -2, -3, -4 }));
+    System.out.println(peak_point(new int[] { -10, 15, 5 }));
+  }
+
+  private static int peak_point(int[] arr) {
+    List<Integer> l = new ArrayList<>();
+    l.add(0);
+    for (var e : arr)
+      l.add(l.getLast() + e);
+    return Collections.max(l);
+  }
+}
-- 
cgit