ADDED DATA STRUCTURE ARRAY ALGORITHMS

VeeruYadav45 · VeeruYadav45 · commit f1c0d8600eb0 · 2025-10-17T09:19:33.000+05:30
diff --git a/src/main/java/com/thealgorithms/datastructures/arrays/LeadersInArray.java b/src/main/java/com/thealgorithms/datastructures/arrays/LeadersInArray.java
@@ -2,6 +2,7 @@
 
 /**
  * A program to find leaders in an array.
+ * https://www.geeksforgeeks.org/dsa/find-a-peak-in-a-given-array/
  * 
  * A leader is an element that is greater than all the elements to its right.
  * The rightmost element is always a leader.
diff --git a/src/main/java/com/thealgorithms/datastructures/arrays/PeakElement.java b/src/main/java/com/thealgorithms/datastructures/arrays/PeakElement.java
@@ -2,6 +2,7 @@
 
 /**
  * A program to find a peak element in an array.
+ * https://www.geeksforgeeks.org/dsa/leaders-in-an-array/
  *
  * <p>
  * A peak element is an element that is greater than or equal to its neighbors.

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,7 @@`
`2`	`2`
`3`	`3`	`/**`
`4`	`4`	`* A program to find leaders in an array.`
	`5`	`+ * https://www.geeksforgeeks.org/dsa/find-a-peak-in-a-given-array/`
`5`	`6`	`*`
`6`	`7`	`* A leader is an element that is greater than all the elements to its right.`
`7`	`8`	`* The rightmost element is always a leader.`
Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,7 @@`
`2`	`2`
`3`	`3`	`/**`
`4`	`4`	`* A program to find a peak element in an array.`
	`5`	`+ * https://www.geeksforgeeks.org/dsa/leaders-in-an-array/`
`5`	`6`	`*`
`6`	`7`	`* <p>`
`7`	`8`	`* A peak element is an element that is greater than or equal to its neighbors.`