leetle

Daily challenge for 2026-08-26

603. Equivalent Fraction Pairs

Given a list of fractions represented as pairs of integers [numerator, denominator], find the number of pairs of indices (i, j) with i < j such that the sum of the two fractions is an integer.

Example:
Input: fractions = [[1, 2], [3, 2], [1, 3], [2, 3]]
Output: 2
Explanation: The pairs are:
- [1, 2] + [3, 2] = 4/2 = 2 (integer)
- [1, 3] + [2, 3] = 3/3 = 1 (integer)

Run this challenge interactively in Python or JavaScript when the app loads.