Problem 2552 · Hard

Count Increasing Quadruplets

Count quadruplets i < j < k < l with nums[i] < nums[k] < nums[j] < nums[l] by combining left and right counts for each middle pair.

Open the interactive visualisation