From 34b2a56e0274a79d471c7fc504257fd8c7bb2f9a Mon Sep 17 00:00:00 2001
From: Sami <i.l.y.e.s@live.fr>
Date: Sun, 6 Oct 2024 16:55:45 -0400
Subject: [PATCH] hourGlassChallenge

---
 HourGlass.class | Bin 0 -> 927 bytes
 HourGlass.java  |  34 ++++++++++++++++++++++++++++++++++
 2 files changed, 34 insertions(+)
 create mode 100644 HourGlass.class
 create mode 100644 HourGlass.java

diff --git a/HourGlass.class b/HourGlass.class
new file mode 100644
index 0000000000000000000000000000000000000000..a181253a141f383e631c3be0f265ee8978d3c662
GIT binary patch
literal 927
zcmaJ<T~8B16g|_O*=d(jinx4N#m}}Tknq3@$P0<u1guF3Nz(^eV1tY8mb6<VPsW5_
z;7`y8UwqLAB}R$9;&1R5_z#E?&uj_U#JI_wdw0&gXYQG~N54NE0$4)PK?0VBOhdsI
z$nJPgy_vcfZqJlAcKppqz+MQ#AX*f#@`W{xq(GupO2I*&MmmjtWO~Xfd+o??FuU1d
zvAY}-2F;m=tssmlQOoxl^A55Y)VPqw5H1R&?l(KFdv&kf=4tItqZFEB^R-&3P;xMg
z5slF_#xO20^ba}#y=%zpp@7Vn3TqA~k<+-8#${X)$ee3h@uJ6Ut>HZrQ27%1S+dmJ
z@&yK#gV2A_X>9ndRd1ut9og^#QV!>9T@mrEP(cuG&llDN`YVyQ`DDf0jq^2bk(oUU
zI2G#I^zR0SC37Zj+Vp`bYESU)0SjybHrFZs<>&>yDt?4`$3WmJR|A_kg=@G@Z&H6k
z#}wbQ_7~`?m9;-RRZEtulBQ_3Rjz7U(kfS~vJ3M!hUt4?_5W)7yqc9tv09Uy7L)5<
z*pM^j?CfMOY+5t$Y4!4Zq;4Nz-~-%q!5Q8Qkil2p(-8(aXPl8!;XfcL9e7bZTqs(z
zhj+5y7Ogqy$_cgg3UzBvxoXmcwW2F$T{Ycxa(#Ne8>wz2*9o5PDig<e9R0m(vghoa
zYad`@abJlyC$IM<*O$4sY$6fAPmv9R4O(!K#0dH@%84E0JB_2xIcziD<KA=5;tghw
aL!MBb(zq%30l(mgV>~+MC<x?Z-ohWE7OVIG

literal 0
HcmV?d00001

diff --git a/HourGlass.java b/HourGlass.java
new file mode 100644
index 0000000..cdf5ddc
--- /dev/null
+++ b/HourGlass.java
@@ -0,0 +1,34 @@
+public class HourGlass {
+
+  /*
+   * 1 1 1 0 0 0
+   * 0 1 0 0 0 0
+   * 1 1 1 0 0 0
+   * 0 0 0 0 0 0
+   * 0 0 0 0 0 0
+   * 0 0 0 0 0 0
+   */
+
+  public static void main(String[] args) {
+
+    int[][] ar = { { 1, 1, 1, 0, 0, 0 }, { 0, 1, 0, 0, 0, 0 }, { 1, 1, 1, 0, 0, 0 }, { 0, 0, 2, 4, 4, 0 },
+        { 0, 0, 0, 2, 0, 0 }, { 0, 0, 1, 2, 4, 0 } };
+    System.out.println(sumInt(ar));
+  }
+
+  private static int sumInt(int[][] arr) {
+    int rows = arr.length;
+    int columns = arr[0].length;
+
+    int total = -63;
+    for (int i = 0; i < rows - 2; i++) {
+      for (int j = 0; j < columns - 2; j++) {
+        int currentSum = arr[i][j] + arr[i][j + 1] + arr[i][j + 2] + arr[i + 1][j + 1] + arr[i + 2][j]
+            + arr[i + 2][j + 1] + arr[i + 2][j + 2];
+        total = Math.max(total, currentSum);
+      }
+    }
+    return total;
+  }
+
+}