Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Backtracking

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Backtracking

Permutations

beginnerlayer I6 · Backtracking5 tests

Given an array nums of distinct integers, return every possible ordering of those integers.

  • An array of n distinct values has n! permutations
  • The permutations may be returned in any order, but each one must list all n values exactly once
  • An empty input has exactly one permutation: the empty arrangement, so return [[]]

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen