Problem Submissions Solution

Unique Permutations

Difficulty: Medium

Acceptance: %

Points: 30.00

Given a string s, the goal is to return a list of all unique permutations of the string, including those that may contain duplicate characters, and return them in lexicographical order.

Topics

Companies

Articles

Examples:

Expected Time Complexity: O(n! * n)

Expected Space Complexity: O(n! * n)

Constraints:
  • 1 <= s.size() <= 5
Companies:
Amazon Microsoft Samsung Walmart Cisco + 1 more
Topics:
String
Locked Content
Access Restricted: Please Login to access the code editor and test cases.