Given a string that may contain duplicate characters (e.g., 'google'), implement an efficient algorithm to generate all unique permutations of the string. The solution should avoid generating duplicate results and optimize for both time and space complexity, explaining how duplicates are handled during the recursion process.