leetle

Daily challenge for 2026-09-08

616. Symmetrical Runway Alignment

An airport runway has a sequence of landing markers represented by a list of integers markers. To determine if the lighting on the runway is balanced, a system checks whether the markers match inward from both outer ends.

Return the number of opposite pairs (markers[i], markers[n - 1 - i]) for 0 <= i < floor(n / 2) that have identical values.

Example:
Input: markers = [1, 3, 2, 3, 1]
Output: 2
Explanation: Pair (1, 1) at indices 0 and 4 matches, and pair (3, 3) at indices 1 and 3 matches. The middle marker at index 2 is unpaired.

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