Blog
Home
About
Category
merge-sort
Number of Pairs Satisfying Inequality
Posted last year
The problem involves two arrays, and an integer diff. The task is to count the number of pairs (i, j) satisfying an inequality.