CodingEasycod-g958

Subject ArraysLevel Entry–Mid~13 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given a list of integers nums, count the number of unordered pairs of positions (i, j) with i < j whose values are equal. For example [1, 1, 1] has 3 such pairs and [1, 2, 1] has 1. Return the total count. The list may be empty (return 0).

Implement

count_equal_pairs(nums: list[int]) → int

Examples

in[[1,1,1]]out3

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.