Available question text
Given a permutation, find the minimum number of adjacent swaps to make it "semi-ordered" (1 at index 0 and n at index n-1) — equivalently, move 1 left to the front and n right to the end, summing their distances but subtracting one if 1 is originally to the right of n because their moves overlap.
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 2717. Semi-Ordered Permutation
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source