How should I practice Permutations II?

Start by reading the full statement, solve the visible examples, then compare the pattern against related LinkedIn phone screen problems in FastPrep.

Is Permutations II associated with LinkedIn?

FastPrep tags this as a LinkedIn phone screen coding practice problem when the problem catalog has that company and stage context.

LinkedIn● MediumFULLTIMEPHONE SCREEN

Given a lowercase string s, return every distinct permutation of its characters exactly once.

Return the permutations in ascending lexicographic order. Equal characters from different input positions must not create duplicate strings.

uniquePermutations(s: String) → String[]

s = "aab"return = ["aab","aba","baa"]

There are three distinct arrangements after duplicate swaps of the two a characters are removed.

s = "xxyy"return = ["xxyy","xyxy","xyyx","yxxy","yxyx","yyxx"]

The four positions have six unique arrangements because each character appears twice.

s = "z"return = ["z"]

A one-character string has one permutation.