Permutations
Updated
Problem statement
Given an array of distinct integers, return every possible ordering of its values.
Return the list of permutations in lexicographic order.
Function
permute(nums: int[]) → List<List<Integer>>Examples
Example 1
nums = [1,2,3]return = [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]Every one of the six orderings appears exactly once.
Constraints
1 <= nums.length <= 8-10^9 <= nums[i] <= 10^9- All values are distinct.
More Atlassian Online Assessment questions
- Planning ProductionOA · Seen Feb 2025
- K-Means ClusteringOA · Seen Feb 2025
- Minimum Sorted Erasure OperationsOA · Seen Jun 2024
- Count Analogous ArraysOA · Seen Mar 2024
- Get Maximum ScoreOA · Seen Mar 2024
- Better Compression 🦀OA · Seen Mar 2024
- Romanizer 🐡OA · Seen Mar 2024
- Flower Bouquets 💐OA · Seen Mar 2024
- Binary Search Tree IteratorOA · Seen Nov 2023
- Binary Tree Level Order TraversalOA · Seen Nov 2023
Similar questions at other companies
- Alternating Parity PermutationsGoldman Sachs · OAGoldman Sachs interview questions
- Generate Parameter CombinationsGecko Robotics · OA · PHONE SCREEN
- Count Legal Outfit CombinationsDuolingo · OADuolingo interview questions
- N-QueensIntuit · OAIntuit interview questions
- Permutation Enumeration (Practice Reconstruction)Roblox · OARoblox interview questions
- Optimal Account BalancingVirtu Financial · OAVirtu Financial interview questions
- Enumerate Valid Clock TimesMicrosoft · OAMicrosoft interview questions
- SubsetsTemu · PHONE SCREENTemu interview questions
- Unique Single-Use Sum CombinationsLinkedIn · ONSITE INTERVIEWLinkedIn interview questions
- Bounded Combination Sum with Signed CandidatesConfluent · ONSITE INTERVIEWConfluent interview questions