Permutations
Explain the Problem
Given an array nums of distinct integers, return all possible permutations. You can return the answer in any order.
Example:
Input: nums = [1, 2, 3]
Output:
[
[1, 2, 3],
[1, 3, 2],
[2, 1, 3],
[2, 3, 1],
[3, 1, 2],
[3, ...
lietcode.hashnode.dev3 min read