Reverse Shuffle Merge

  • + 2 comments

    This problem is not clear enough, for starters in the problem it says to find the smallest lexicographical string A, but by reading these comments it seems that the real goal is to find the original string A, so which is it??? I mean, does one have to find the smallest lexicographic inside string S or does one has to find the original string A in S?