Merge pull request ashishps1#22 from Arnab7456/main

Integer Overflow in Max Heap Comparator for K Closest Points to Origin

Author: ashishps1

patterns/java/TopKElements.java

@@ -126,7 +126,9 @@ private int getDistance(int[] point) {
 
  public int[][] kClosestPointsToOriginMaxHeapApproach(int[][] points, int k) {
  // Max heap with custom comparator to compare by distance
- PriorityQueue<int[]> maxHeap = new PriorityQueue<>((a, b) -> getDistance(b) - getDistance(a));
+ PriorityQueue<int[]> maxHeap = new PriorityQueue<>(
+ (a, b) -> Integer.compare(getDistance(b), getDistance(a))
+ );
 
  // Iterate through all points
  for (int[] point : points) {
@@ -146,4 +148,4 @@ public int[][] kClosestPointsToOriginMaxHeapApproach(int[][] points, int k) {
 
  return result;
  }
-}
+}