Traverse the second set and check if any element of it is already in hash or not .
for ( int i = 0 ; i < set2 . Length ; i ++ ) { if ( set . Contains ( set2 [ i ] ) ) { return false ; } } return true ; }