I was doing this [question](https://www.hackerrank.com/contests/hackerrank-hackfest-2020/challenges/strictly-increasing-sequence) asked in recent HackFest in Hackerrank .↵
I know its too simple but anyhow i m not able to score all 20 points.↵
↵
<spoiler summary="my code">↵
↵
~~~~~↵
string whoIsTheWinner(vector<int> v) { ↵
↵
set<int> s;for(unsigned int i=0;i<v.size();i++)s.insert(v[i]);↵
↵
if(int(v.size()-s.size())%2==0 or s.size()%2==0) return "First"; ↵
↵
return "Second"; }↵
~~~~~↵
↵
↵
</spoiler>↵
↵
Please help ..i m not able to find the solution.
I know its too simple but anyhow i m not able to score all 20 points.↵
↵
<spoiler summary="my code">↵
↵
~~~~~↵
string whoIsTheWinner(vector<int> v) { ↵
↵
set<int> s;for(unsigned int i=0;i<v.size();i++)s.insert(v[i]);↵
↵
if(int(v.size()-s.size())%2==0 or s.size()%2==0) return "First"; ↵
↵
return "Second"; }↵
~~~~~↵
↵
↵
</spoiler>↵
↵
Please help ..i m not able to find the solution.