Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 158

Permutations

MediumBacktracking

Return every permutation of nums. Sort the list of permutations lexicographically.

Examples

Example 1

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 ≤ 6All values unique

Target ComplexityNot required

exponential Time · O(depth) Space

Companies (6)

AmazonGoogleMetaMicrosoftAppleAdobe

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputnums = [1,2,3]

Expected[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]

Output—