Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3149. Find the Minimum Cost Array Permutation
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source