Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3149. Find the Minimum Cost Array Permutation
Find a Hamiltonian cycle on nodes 0..n-1 where the directed edge cost from u to v is |u - nums[v]|, and return the permutation (cycle order) with minimum total cost, breaking ties by lexicographic order. With n ≤ 14 this is typically solved by exponential (bitmask/DP or search) techniques.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.