Tap here to switch tabs
Problem
Submissions

Problem: Number of Intersecting Interval Pairs I

Number of Intersecting Interval Pairs I asks you to return the total number of pairs of inclusive intervals in an integer array that share at least one point, counting each pair once.

Statement

Given a two-dimensional integer array intervals of length nn, where each intervals[i] =[starti,endi]= [\text{start}_i, \text{end}_i] represents an inclusive interval from starti\text{start}_i to endi\text{end}_i, return the total number of pairs of intervals (i,j)(i, j) with 0≤i<j<n0 \leq i < j < n that intersect.

Two intervals intersect if they have at least one common point.

Constraints:

  • 2≤n==2 \leq n == intervals.length ≤100\leq 100

  • intervals[i] =[starti,endi]= [\text{start}_i, \text{end}_i]

  • 0≤starti≤endi≤1000 \leq \text{start}_i \leq \text{end}_i \leq 100

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Number of Intersecting Interval Pairs I

Number of Intersecting Interval Pairs I asks you to return the total number of pairs of inclusive intervals in an integer array that share at least one point, counting each pair once.

Statement

Given a two-dimensional integer array intervals of length nn, where each intervals[i] =[starti,endi]= [\text{start}_i, \text{end}_i] represents an inclusive interval from starti\text{start}_i to endi\text{end}_i, return the total number of pairs of intervals (i,j)(i, j) with 0≤i<j<n0 \leq i < j < n that intersect.

Two intervals intersect if they have at least one common point.

Constraints:

  • 2≤n==2 \leq n == intervals.length ≤100\leq 100

  • intervals[i] =[starti,endi]= [\text{start}_i, \text{end}_i]

  • 0≤starti≤endi≤1000 \leq \text{start}_i \leq \text{end}_i \leq 100