Permutations II (with duplicates)

**Problem Statement:** Given the required input arguments, write an efficient algorithm to solve the **Permutations II (with duplicates)** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge. **Hint / Expected Approach:** Sort + skip if nums[i]==nums[i-1] and prev not used **Edge Cases to Consider:** - (1) All same elements - (2) No duplicates - (3) Large array with many repeats

Examples

Example 1

Input: [1,1,2]

Output: [[1,1,2],[1,2,1],[2,1,1]]

Explanation: 3 unique

Example 2

Input: [1,2,3]

Output: All 6 permutations

Explanation: No dups

Example 3

Input: [1,1,1]

Output: [[1,1,1]]

Explanation: Single

Constraints

▪Input arguments are within valid ranges
▪Optimize for execution speed
▪Handle null/empty inputs gracefully

Watch Out For Edge Cases

▪All same elements
▪No duplicates
▪Large array with many repeats

Frequently Asked At

AmazonGoogleMicrosoftAdobe

Back to Arena

medium

Backtracking