cpp-flashcards/org/study_deck_02/dsa/backtracking/0046-permutations.org

#+ANKI_DECK: study_deck_02
* TODO 0046. Permutations :medium:
:PROPERTIES:
:NEETCODE: [[file:../../roadmap.org::*0046. Permutations][0046. Permutations]]
:END:

Given an array ~nums~ of distinct integers, return all the possible permutations. You can return the answer in *any order*.

*Example 1:*


#+begin_src
Input: nums = [1,2,3]
Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
#+end_src
*Example 2:*


#+begin_src
Input: nums = [0,1]
Output: [[0,1],[1,0]]
#+end_src
*Example 3:*


#+begin_src
Input: nums = [1]
Output: [[1]]
#+end_src


*Constraints:*

 - ~1 <= nums.length <= 6~

 - ~-10 <= nums[i] <= 10~

 - All the integers of ~nums~ are *unique*.

** TODO Approach
Write your approach here.

** TODO Python
#+begin_src python :lc-problem 46 :lc-lang python3
class Solution:
    def permute(self, nums: List[int]) -> List[List[int]]:
#+end_src

** TODO C++
#+begin_src cpp :lc-problem 46
class Solution {
public:
    vector<vector<int>> permute(vector<int>& nums) {
        
    }
};
#+end_src