Inverted words

1.theString first in the pair is always less than to second 2.don't filter repeated pair

task2207 (Inverted words) UNDOCUMENTED REQUIREMENTS: the validator rejected my first solution, which looked only for *consecutive* mirror pairs (since this was fully compatible with the task description and the examples). The validator accepted my second solution, which found mirror pairs regardless of how many other words were between them. These pairs were output in the order they were matched up (i.e. an output pair was generated at the point where the second part appeared in the input sequence). It would have been easy to add a non-consecutive pair to the examples or to mention this somewhere. But they didn't. And this isn't the first time that a task description was not only incomplete but deliberately misleading. Perhaps someone needs to be reminded who is paying whom here... 🙄 I would have given this task a double upvote if it weren't for this deliberate sabotage. Ergo double downvote.

Maybe it will give someone ideas, but what I did was: *read the file contents into words and added it to an arraylist

words.addAll(Arrays.asList(line.split("\\s+"))); //can refactor into more than 1 line if you want to

*reversed each individual word and checked for the reversed word it in the arraylist. * also made a special check for words that are palindromes (like "toto"---> when these words are reversed they look the same. to make sure the algorithm doesn't count these words twice I put a marker on them. * if the word list .contains(reversed word) put both the original word and reversed in results. *remove or edit both words so they are no longer counted.

Just a fight against the validator. I made several solutions that were better than the 'answer' they provided and none were validated. Also - why does StringBuilder need to be in main? I pushed all of the pair code into a separate method as is better practice and had to just put a random StringBuilder object in main just to pass. Also - it needs to be much clearer what you want in result at the end. 'All pairs of words that are mirror images of each other' just isn't clear enough. What if the file was 'tot(1) tot(2) tot(3) tot(4)'? Output should be: tot1 tot2 tot1 tot3 tot1 tot4 tot2 tot3 tot2 tot4 tot3 tot4 but that isn't what you want.....

Make sure to actually print the resulting pairs to console in the end.

CHECK YOUR CODE WITH THIS INPUT: rat tar tart a a tot tot tot rat tot a tot OUTPUT: rat tar a a tot tot tot tot It seems you only match each individual word ONCE but if that word appears again later on and it too has a match you add that as well. Also don't just check if the next word is mirrored, if the next word does not mirror, look at all the rest of the words. If you find a match, you can't use that word again (I think!)

Attention: The mirror images can be the same.