Tap here to switch tabs
Problem
Submissions

Problem: Count Pairs in Two Arrays

Count Pairs in Two Arrays asks you to compare two arrays and return how many pairs of positions, with the first before the second, have a larger combined value in the first array.

Statement

You are given two positive integer arrays, nums1 and nums2, both of length nn. Your task is to count and return the number of pairs of indexes (i,j)(i, j) where:

  • i<ji < j , and

  • nums1[i]+nums1[j]>nums2[i]+nums2[j]\text{nums1}[i] + \text{nums1}[j] > \text{nums2}[i] + \text{nums2}[j]

In simpler terms, the sum of two elements from nums1 must be greater than that of the corresponding elements from nums2.

Constraints:

  • n=n = nums1.length == nums2.length

  • 1≤n≤1031 \leq n \leq 10^3

  • 1≤1 \leq nums1[i], nums2[i] ≤104\leq 10^4

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Count Pairs in Two Arrays

Count Pairs in Two Arrays asks you to compare two arrays and return how many pairs of positions, with the first before the second, have a larger combined value in the first array.

Statement

You are given two positive integer arrays, nums1 and nums2, both of length nn. Your task is to count and return the number of pairs of indexes (i,j)(i, j) where:

  • i<ji < j , and

  • nums1[i]+nums1[j]>nums2[i]+nums2[j]\text{nums1}[i] + \text{nums1}[j] > \text{nums2}[i] + \text{nums2}[j]

In simpler terms, the sum of two elements from nums1 must be greater than that of the corresponding elements from nums2.

Constraints:

  • n=n = nums1.length == nums2.length

  • 1≤n≤1031 \leq n \leq 10^3

  • 1≤1 \leq nums1[i], nums2[i] ≤104\leq 10^4