Count mirror matches
Given an integer array nums of length n, count how many mirror pairs match: positions i and n-1-i (for i < n/2) holding equal values. The middle element of an odd-length array pairs with itself and is never counted. Return the count. Example: [1, 5, 3, 5, 1] gives 2 — positions 0 and 4 match, positions 1 and 3 match, and the middle 3 is ignored.
Implement
count_mirror_matches(nums: list[int]) → intExamples
in
[[1,5,3,5,1]]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 10 min
solution.py
InputExpectedGot
[[1,5,3,5,1]]2not run yetsample