From aba14d40292bea7728543efc191c882c0415249e Mon Sep 17 00:00:00 2001
From: Evan Ferrao <evanferrao@gmail.com>
Date: Thu, 8 Aug 2024 00:09:59 +0530
Subject: [PATCH] improve UniqueArrayElement.java

---
 Basic/UniqueArrayElement.class | Bin 0 -> 2335 bytes
 Basic/UniqueArrayElement.java  |  69 ++++++++++++++++++++++++++++++++-
 2 files changed, 67 insertions(+), 2 deletions(-)
 create mode 100644 Basic/UniqueArrayElement.class

diff --git a/Basic/UniqueArrayElement.class b/Basic/UniqueArrayElement.class
new file mode 100644
index 0000000000000000000000000000000000000000..34225bbd3e2b12fedcdc1308c35bf4a9242955b9
GIT binary patch
literal 2335
zcmaJ?-%}G;6#i~@lMQhdhy<xgG*qk*CA9TdHQ)~rYLFk+Afnjn5*ArWc4@M4%1j^H
z4*x)39H%dJoOYb)_);I#LC2ZCcKT=ZvC~dp8L9p5CYmT940|u<p7WjWeCO=m-~U^A
z4&W$qA++KH4f`6<iLMZQNXp&*AP$7kjg++X1o5F<KML{W;}9Y^7?#0d2pp6D9uM=>
z+x3Q_;FyLJ$~W}Ta8ko5fk3ZiTkZ(~rL${NKpk*qO@YP{%QnZ#g&DIrVa()dQ45A;
z3$%7lkK8nF89jN!zR{C)i<W&OEd#e^T_d+JYAkyG8cu8I7YNN+_UuL5`m#(2f9G_j
zD?^N$@nVVb3|izO&{8|-FP2?%&MD>?7s@(iZiXz$V@Cz;bg^hG4d%^)X}c*&NXHJe
z2{e1;%C42~$>t2(Hj5etbezGUbQsd{Db5OX4ce|*Ot|xA!uE<xICBZJf>ugcws&I4
z6dE!*hH*~E2u1~V*8*R=GgJb3?mEWMrehrEbtKR((A4iZZpkegi=(DH@647O1Nbb6
z3p%ox2;!n#Cw07!_8>0l*dy1eS7mq_XGryiSriDbublX`W{l6=G;^-N_6<5D;G3rM
zb>7*fl4}-dmtBoidTKd68GEtpvaP03NDH)eZg?R3tvF@oss*0sB-8@8d$fpGXBN;F
zrBhxetOCD1MVf7X<+5UL97))p%R41@y*XDd7TM|vt6+{=`Mg!~JcdKKj4J{i6Kp`)
z8?#q!e4~pAtCSF&or1Ao4mftsa4%WzJa;A6uw7zBIx}7C=UU*POqg&PW+!Hr61DkE
z%$4n&YdN+DohW#m%$#G-dT7HNqMh6ft^PH5Cvx9r2(|a+9q}5b<-A>^V70Na>|4%)
zS$&l&;tUx%*C}%L4SpX+9A}}tD4=KL+cc0jN+pvu-l^|k6{9lZXAOHcZ<abLf$8<K
z)>+;NoLE{kH*l{X=gN$y>(#A73>f)*)^g3Xh8cmq>+0Kxo4~Gj`|%x)@Ea_D{QTn=
zhM(2<xQlZY(wck>@hdk1JNXQFMimW+BE~&k#TkYMdG_=ve3u_Wc?@;rA^hRMBWU{{
zA=npt78;X=1{#zjYDA6QLvwdTm51ZYs<{91A8tcWu;r*qzwRf{SFjbJyR-#pYYnuj
z<_fmGHdY-QH*suw+p&2QN8Tk&BMbC-1zz#g2w)5EkL@h0jitsALI*9~&~cb+nmkTY
zw=?w3QnM*~%~Og35x%A{-!kHRDtH^a@H2Mf7plC1c3PyuzL(eszlL2Jd_u!+s=Ufn
z4RmU+D2nsE#}qoZDZNTxEcyH%8l%Zr>bu@$AI17N`rtL)R<CV)NWOz4_o9hwEAeG2
z-kNJrg;+&13*iU2ivAl^{sI@mEwA8Ph#vh38kb6rzoP2(XQ5H$L|kSMA4tYiS5xZs
z@nwYs{-*hWXO5@TyYR;!RLs5_uj8^+6iLA;3U(S{^pn>q3NuJ1LrC(PI>_}HGCUo|
zS)AiD!^+1z?r{Xy;1{B475+77Ql?e3ynqnfXkj_LN2=xAW)fLWTIr2SvWJwuD(zS_
z{v(=`(G=O=MNsX#j|PwFpRpfUYc%y>S+JZx>UgKf7MNs$OVn?Qyf3paSIBvq>P}%l
zzCaJIk^3aM&v;xT2)tk`*U%tD8`-TwlN=ScLQd6QhR9|JT*Y;K&N(^6|96t}VcL#(
M&riH(+I#l>5BI|_Q~&?~

literal 0
HcmV?d00001

diff --git a/Basic/UniqueArrayElement.java b/Basic/UniqueArrayElement.java
index a644e16..e494f82 100644
--- a/Basic/UniqueArrayElement.java
+++ b/Basic/UniqueArrayElement.java
@@ -11,9 +11,27 @@ class UniqueArrayElement{
         for(int i=0;i<n;i++){
             arr[i] = sc.nextInt();
         }
-        System.out.println("The unique element in the array is "+findUnique(arr));
+        sc.close();
+        // is there any way to show the time taken by each function to find the unique element in the array?
+        // yes, we can use the System.currentTimeMillis() function to get the current time in milliseconds
+        // we can use this function to get the time before and after the function call
+        // then we can subtract the two times to get the time taken by the function to execute
+        // can you rewrite the above code to show the time taken by each function to find the unique element in the array?
+        // write the code to show the time taken by each function to find the unique element in the array
+        long start = System.currentTimeMillis();
+        System.out.println("The unique element in the array is "+findUniqueUsingXOR(arr));
+        long end = System.currentTimeMillis();
+        System.out.println("Time taken by findUnique function is "+(end-start)+" milliseconds");
+        start = System.currentTimeMillis();
+        System.out.println("The unique element in the array is "+findUniqueUsingMapping(arr));
+        end = System.currentTimeMillis();
+        System.out.println("Time taken by findUniqueUsingMapping function is "+(end-start)+" milliseconds");
+        start = System.currentTimeMillis();
+        System.out.println("The unique element in the array is "+findUniqueBruteforce(arr));
+        end = System.currentTimeMillis();
+        System.out.println("Time taken by findUniqueBruteforce function is "+(end-start)+" milliseconds");
     }
-    public static int findUnique(int[] arr){
+    public static int findUniqueUsingXOR(int[] arr){
         int res = 0;
         for(int i=0;i<arr.length;i++){
             res = res^arr[i];
@@ -33,4 +51,51 @@ class UniqueArrayElement{
     // res = 7^3 = 4
     // return 4
 
+    // write another function using hasing technique to find the unique element in the array
+    // write using mapping technique to find the unique element in the array
+    // DO NOT USE XOR
+    // make another array of size of the largest element in the array and then map the elements of the array to the new array
+    // then find the element which is mapped to 1
+    // return that element
+    // return -1 if no such element is found
+    // write the code for the above logic
+    static int findUniqueUsingMapping(int[] arr){
+        int max = Integer.MIN_VALUE;
+        for(int i=0;i<arr.length;i++){
+            if(arr[i]>max){
+                max = arr[i];
+            }
+        }
+        int[] map = new int[max+1];
+        for(int i=0;i<arr.length;i++){
+            map[arr[i]]++;
+        }
+        for(int i=0;i<map.length;i++){
+            if(map[i]==1){
+                return i;
+            }
+        }
+        return -1;
+    }
+
+    // write a bruteforce method to find the unique element in the array
+    // compare each element with all the other elements in the array
+    // if the element is not found in the array then return that element
+    // return -1 if no such element is found
+    static int findUniqueBruteforce(int[] arr){
+        for(int i=0;i<arr.length;i++){
+            boolean found = false;
+            for(int j=0;j<arr.length;j++){
+                if(i!=j && arr[i]==arr[j]){
+                    found = true;
+                    break;
+                }
+            }
+            if(!found){
+                return arr[i];
+            }
+        }
+        return -1;
+    }
+
 }
\ No newline at end of file