MCPcopy Create free account
hub / github.com/Vishruth-S/CompetitiveCode / main

Function main

LeetCode_problems/First Missing Positive/Solution.cpp:17–33  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

15 return i;
16}
17int main() {
18 int t;
19 cin>>t;
20 while(t--){
21 int n;
22 cin >> n;
23 vector<int> v;
24 for(int i=0;i<n;i++){
25 int x;
26 cin >> x;
27 v.push_back(x);
28 }
29 // function responsible for calculating answer
30 cout << solve(v);
31 }
32 return 0;
33}

Callers

nothing calls this directly

Calls 1

solveFunction · 0.70

Tested by

no test coverage detected