CodingEasycod-g1418

Subject Two pointersLevel Entry–Mid~10 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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]) → int

Examples

in[[1,5,3,5,1]]out2

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.