CareerCup

I think this wont work in all cases. Consider "bcabc" - The algorithm will give us "bac", where as the right solution is "abc".

#include <iostream>
#include <algorithm>
#include <string>
#include <unordered_map>

using namespace std;

void printPalindromePairs(string words[], unsigned int size) {
	
	unordered_map<string, int> wordMap;
	for (unsigned int i = 0; i < size; i++) {
		string word = words[i];
		reverse(word.begin(), word.end());
		unordered_map<string, int>::iterator it = wordMap.find(word);
		if (it == wordMap.end()) {
			wordMap[words[i]] = i;
		}
		else {
			cout << "FOUND : " << words[i] << ", " << word << endl;
			wordMap.erase(it);
		}
	}
}

int main() {
	
	string words[] = {"bat", "cat", "ami", "tac", "tab"};
	printPalindromePairs(words, 5);
	return 0;

}