We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Lonely Integer
Lonely Integer
Sort by
recency
|
546 Discussions
|
Please Login in order to post a comment
include
using namespace std ; int main(){ mapmp ; int n , min = INT_MAX ; cin >> n ; for(int i = 1 ; i<= n ; i++){ string nums ; cin >> nums ; mp[nums]++ ; } string ans = "" ; for( auto it = mp.begin() ; it != mp.end() ; it++){ if(it->second < min){ min = it->second ; ans = it->first ; }
} simple
C++ (more at https://github.com/IhorVodko/Hackerrank_solutions/tree/master , feel free to give a star :) )
JavaScript solution using Bitwise XOR. I wrote an article on this at here
In Python 3