JB TAK FODEGA NHI .... TB TK CHODEGA NHI .... (MAANG)

L15 Permutations II

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,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]

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

Notes

Note: Zoom for Better Understanding

This Problem and Permutation I are the Same only Difference is the Dublicay in this Problem, in this Problem or task is Finding the all Unique Permutation

Basically we used the concept of the Swaping the Element that we learn in the Permutation I

But only Chnage is We Carry the set Data Structure for the Storing Only the Unique All Permutation

Recursion Tree

Code Zone!

Recursion Python Code

Recursion Java Code

Recursion C++ Code

Sb Mai He Kru ...

Khud Bhi Kr le Khuch ..... Nalayk

Time Complexity:N! x N
Reason:N! for generating All the Permutation and N: for loop 0 to N every Time Iterate

Space Complexity: O(N) + O(N) O(N) for the my ans DS and O(N) for the Recursive Stack Space.