Loading compiler resources...
Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
permute([1, 2, 3]);
// [
// [1, 2, 3],
// [1, 3, 2],
// [2, 1, 3],
// [2, 3, 1],
// [3, 1, 2],
// [3, 2, 1]
// ]Run your code to see results.
This interactive challenge requires a DeepFrontend Pro membership. Get instant access to write, execute, test, and view verified solution code directly in your browser.
Regional pricing available • Instant access
Stuck? This challenge exercises: