-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path97) Find the repeating and the missing.cpp
60 lines (50 loc) · 1.17 KB
/
97) Find the repeating and the missing.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
vector<int> findTwoElement(vector<int> arr, int n) {
//sort the array first
unordered_map<int, int> cnt;
//initialize cnt with 0
for(int i=0; i<n; i++){
cnt[i+1] = 0;
}
//check the frequency
for(int i=0; i<n; i++){
cnt[arr[i]]++;
}
//missing and repetion check
vector<int> res;
for(auto i:cnt){
if(i.second == 2){
res.push_back(i.first);
}
}
for(auto i:cnt){
if(i.second == 0){
res.push_back(i.first);
}
}
return res;
}
};
//{ Driver Code Starts.
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
Solution ob;
auto ans = ob.findTwoElement(a, n);
cout << ans[0] << " " << ans[1] << "\n";
}
return 0;
}
// } Driver Code Ends