Permutations II Problem

Permutations II Problem — ExecCode Medium DSA Practice

Solve the Permutations II problem on ExecCode. Free online medium DSA practice in Backtracking. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. Examples Example 1 Input: nums = [1,1,2] Output: [[1,1,2], [1,2,1], [2,1,1]] Example 2 Input: nums = [1,2,3] Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] Constraints 1 <= nums.length <= 8 -10 <= nums[i] <= 10

Examples

Input nums = [1, 1, 2]; Output [[1, 1, 2], [1, 2, 1], [2, 1, 1]]. Input nums = [1, 2, 3]; Output [[1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1]]

Constraints

1 <= nums.length <= 8 -10 <= nums[i] <= 10

Practice Permutations II free on ExecCode. Browse DSA problems, topic map, and placement guides.