import
java.util.Arrays;
import
java.util.HashMap;
class
GFG {
public
static
void
findHiddenMissing(
int
arr1[],
int
arr2[],
int
N)
{
Arrays.sort(arr1);
Arrays.sort(arr2);
HashMap<Integer, Integer> mp =
new
HashMap<Integer, Integer>();
for
(
int
i =
0
; i < N -
1
; i++)
{
int
a = arr2[i] - arr1[i];
int
b = arr2[i] - arr1[i +
1
];
if
(a != b) {
if
(a >
0
) {
if
(mp.containsKey(a))
mp.put(a, mp.get(a) +
1
);
else
mp.put(a,
1
);
}
if
(b >
0
)
if
(mp.containsKey(b))
mp.put(b, mp.get(b) +
1
);
else
mp.put(b,
1
);
}
else
{
if
(a >
0
)
if
(mp.containsKey(a))
mp.put(a, mp.get(a) +
1
);
else
mp.put(a,
1
);
}
}
int
hidden =
0
;
for
(
int
it : mp.keySet()) {
if
(mp.get(it) == N -
1
) {
hidden = it;
System.out.println(
"Hidden: "
+ it);
break
;
}
}
for
(
int
i =
0
; i < N; i++) {
if
(arr1[i] + hidden != arr2[i]) {
System.out.println(
"Missing: "
+ arr1[i]);
break
;
}
}
}
public
static
void
main(String args[]) {
int
arr1[] = {
3
,
6
,
5
,
10
};
int
arr2[] = {
17
,
10
,
13
};
int
N = arr1.length;
findHiddenMissing(arr1, arr2, N);
}
}