# Leetcode 47 - Permutations II

Note:

• Backtracking question.
• Need a used[] array
• Avoid adding a same element multiple times.
• Avoid duplicates in ans[].
• It’s easier to write an if statement for continue condition first.

Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.
Example