From a5d74e9df8b77c7c24249423b8e8f1f057284daf Mon Sep 17 00:00:00 2001
From: TurinTech Bot <bot@turintech.ai>
Date: Tue, 26 Nov 2024 11:28:23 +0000
Subject: [PATCH] Artemis Changes

---
 app/src/main/java/control/Double.java | 40 ++++++++++-----------------
 1 file changed, 15 insertions(+), 25 deletions(-)

diff --git a/app/src/main/java/control/Double.java b/app/src/main/java/control/Double.java
index cc5cf15..bff86cb 100644
--- a/app/src/main/java/control/Double.java
+++ b/app/src/main/java/control/Double.java
@@ -10,11 +10,7 @@ public class Double {
   public static int sumSquare(int n) {
     int sum = 0;
     for (int i = 0; i < n; i++) {
-      for (int j = 0; j < n; j++) {
-        if (i == j) {
-          sum = sum + i * j;
-        }
-      }
+      sum = sum + i * i;
     }
     return sum;
   }
@@ -27,10 +23,8 @@ public static int sumSquare(int n) {
    */
   public static int sumTriangle(int n) {
     int sum = 0;
-    for (int i = 0; i < n + 1; i++) {
-      for (int j = 0; j < i; j++) {
-        sum = sum + j;
-      }
+    for (int i = 1; i <= n; i++) {
+      sum += i * (i + 1) / 2;
     }
     return sum;
   }
@@ -44,19 +38,17 @@ public static int sumTriangle(int n) {
    * @return The number of pairs in the array.
    */
   public static int countPairs(int[] arr) {
-    int count = 0;
-    for (int i = 0; i < arr.length; i++) {
-      int nDuplicates = 0;
-      for (int j = 0; j < arr.length; j++) {
-        if (arr[i] == arr[j]) {
-          nDuplicates++;
-        }
-      }
-      if (nDuplicates == 2) {
-        count++;
+    java.util.Map<Integer, Integer> counts = new java.util.HashMap<>();
+    for (int num : arr) {
+      counts.put(num, counts.getOrDefault(num, 0) + 1);
+    }
+    int pairCount = 0;
+    for (int count : counts.values()) {
+      if (count == 2) {
+        pairCount++;
       }
     }
-    return count / 2;
+    return pairCount;
   }
 
   /**
@@ -70,10 +62,8 @@ public static int countPairs(int[] arr) {
   public static int countDuplicates(int[] arr0, int[] arr1) {
     int count = 0;
     for (int i = 0; i < arr0.length; i++) {
-      for (int j = 0; j < arr1.length; j++) {
-        if (i == j && arr0[i] == arr1[j]) {
-          count++;
-        }
+      if (i < arr1.length && arr0[i] == arr1[i]) {
+        count++;
       }
     }
     return count;
@@ -97,4 +87,4 @@ public static int sumMatrix(int[][] arr) {
     }
     return sum;
   }
-}
+}
\ No newline at end of file