---
title: "Discussion on \"Problem: Permutation II\" | Hashnode"
description: "Discussion on \"Problem: Permutation II\". Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.\n\nExample 1:\nInput: nums = [1,1,2]\nOutput:\n[[1,1,2],\n [1,2,1],\n [2,1,1]]\nExample 2:\n\nInput: nums = [1,2,3]\n   Output: [[1,2,3],[1..."
url: "https://hashnode.com/posts/problem-permutation-ii/62fdba710cfd6de8c7d79b7b"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Problem: Permutation II](https://mackph.hashnode.dev/problem-permutation-ii?utm_source=hashnode&utm_medium=feed)

Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. 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...

Aug 18, 2022 · 1 min read · mackph.hashnode.dev  
Read the article

-   [#java](https://hashnode.com/tag/java)
-   [#easy](https://hashnode.com/tag/easy)
-   [#java-programming](https://hashnode.com/tag/java-programming)
-   [#backtracking](https://hashnode.com/tag/backtracking)

## Written by

[ANKUSH KUMAR](https://hashnode.com/@akankushjnvku)

@akankushjnvku · India

  
[View profile](https://hashnode.com/@akankushjnvku)

I am an intermediate back-end developer, graphic and Adobe designer working for the past few years.

({MERN Stack Developer at mackph}) | <Ex-Internshala Student Partner(ISP 16)> | <5 star coder at Hackerrank> | <Self employed at Mackph> | <GSSoC '22 Contributor> | <Ex-Campus Ambassador at International MUN>

## Responses

Markdown supported · ⌘↵ to post

No responses yet.