Count equal pairs
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]) → intExamples
in
[[1,1,1]]out3What 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 13 min
solution.py
InputExpectedGot
[[1,1,1]]3not run yetsample