Skip to content

Latest commit

 

History

History
11 lines (6 loc) · 1.38 KB

File metadata and controls

11 lines (6 loc) · 1.38 KB

CountReversePairs extreme

by jiangshan @jiangshanmeta

Take the Challenge

Given an integer array nums, return the number of reverse pairs in the array.

A reverse pair is a pair (i, j) where:

  • 0 <= i < j < nums.length and
  • nums[i] > nums[j].

Back Share your Solutions Check out Solutions

Related Challenges

741・Sort