From acce4683561a00ce413c599d70abda8b579680ce Mon Sep 17 00:00:00 2001
From: gunescelil <19296628+gunescelil@users.noreply.github.com>
Date: Sat, 26 Sep 2020 19:27:14 +0300
Subject: [PATCH] Update OddOccurrencesInArray.java

make solution like this

// write your code in Java SE 8
        HashSet<Integer> dups = new HashSet<>();

        for (int i = 0; i < A.length; i++)
        {
            if (!dups.add(A[i]))
            {
                dups.remove((A[i]));
            }
        }

        return (Integer) dups.toArray()[0];
---
 src/codility/OddOccurrencesInArray.java | 18 ++++++++++--------
 1 file changed, 10 insertions(+), 8 deletions(-)

diff --git a/src/codility/OddOccurrencesInArray.java b/src/codility/OddOccurrencesInArray.java
index 4c28497..bc3204e 100644
--- a/src/codility/OddOccurrencesInArray.java
+++ b/src/codility/OddOccurrencesInArray.java
@@ -35,15 +35,17 @@ public static int solution(int[] A) {
 	// Space: O(N)
 	public static int solution2(int[] A) {
 		// write your code in Java SE 8
-		HashSet<Integer> dups = new HashSet<Integer>();
-		int elem = -1;
+        HashSet<Integer> dups = new HashSet<>();
 
-		for (int i = 0; i < A.length; i++) {
-			if (dups.add(A[i])) {
-				elem = A[i];
-			}
-		}
-		return elem;
+        for (int i = 0; i < A.length; i++)
+        {
+            if (!dups.add(A[i]))
+            {           
+                dups.remove((A[i]));
+            } 
+        }
+        
+        return (Integer) dups.toArray()[0];
 	}
 
 	// Time: O(N^2)