terminal
Elevo
/
ESC
Login
Initiate Registration
code
Topics
corporate_fare
Companies
history
History
arrow_back
Back to Challenges
#46
Permutations
Medium
Acceptance 0%
Editorial
description
Problem Description
Given an array `nums` of distinct integers, return all the possible permutations. You can return the answer in any order.
checklist
Constraints
1 <= nums.length <= 6
-10 <= nums[i] <= 10
All the integers of nums are unique.
science
Examples
Case #1
In:
nums = [1,2,3]
Out:
[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
Case #2
In:
nums = [0,1]
Out:
[[0,1],[1,0]]
Mastery Tags
Arrays
Backtracking
Hiring Companies
Amazon
Meta
Microsoft
code
Integrated IDE
Python 3
expand_more
C
C++ 17
Java
JavaScript
Python 3
C
C++ 17
Java
JavaScript
Python 3
refresh
class Solution: def permute(self, nums: list[int]) -> list[list[int]]: pass
Login to Compile
Processing
terminal
Debug Output
home
Home
extension
Practice
robot_2
login
Sign In
account_circle
Menu
code_blocks
Coding
psychology
Aptitude
Navigation
close
Login
Registration