From 369be422f3c345db53b1911633f3aa19129c1238 Mon Sep 17 00:00:00 2001
From: SamISCx <cis.samuel2007@gmail.com>
Date: Fri, 16 Oct 2026 22:01:51 +0530
Subject: [PATCH 1/2] Implement diagonal sum calculation for a matrix

---
 Java/1677_Matrix_Diagonal_Sum.java | 14 ++++++++++++++
 1 file changed, 14 insertions(+)
 create mode 100644 Java/1677_Matrix_Diagonal_Sum.java

diff --git a/Java/1677_Matrix_Diagonal_Sum.java b/Java/1677_Matrix_Diagonal_Sum.java
new file mode 100644
index 00000000..707c2e09
--- /dev/null
+++ b/Java/1677_Matrix_Diagonal_Sum.java
@@ -0,0 +1,14 @@
+class Solution {
+    public int diagonalSum(int[][] mat) {
+        int n=mat.length;
+        int sum=0;
+        for(int i=0;i<n;i++){
+            sum+=mat[i][i];
+            sum+=mat[n-i-1][i];
+        }
+        if(n%2!=0){
+            sum-=mat[n/2][n/2];
+        }
+        return sum;
+    }
+}

From 445538ee9a3da5cc9dbbfe94ef404bcb7b5af547 Mon Sep 17 00:00:00 2001
From: SamISCx <cis.samuel2007@gmail.com>
Date: Fri, 16 Oct 2026 22:16:07 +0530
Subject: [PATCH 2/2] Implement binary search to find peak element

---
 Java/162_find_peak_element.java | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 Java/162_find_peak_element.java

diff --git a/Java/162_find_peak_element.java b/Java/162_find_peak_element.java
new file mode 100644
index 00000000..d36dd09a
--- /dev/null
+++ b/Java/162_find_peak_element.java
@@ -0,0 +1,16 @@
+class Solution {
+    public int findPeakElement(int[] nums) {
+        int i=0;
+        int j=nums.length-1;
+        while(i<j){
+            int mid=i+(j-i)/2;
+            if(nums[mid]<nums[mid+1]){
+                i=mid+1;
+            }
+            else{
+                j=mid;
+            }
+        }
+        return i;
+    }
+}