Available question text
Given a permutation nums of 0..n-1, determine whether every global inversion is also a local inversion (i.e., the counts are equal). This is equivalent to checking that there are no inversions between elements separated by two or more indices — no pair (i, j) with j >= i+2 and nums[i] > nums[j].
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 775. Global and Local Inversions
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source