Count Identical Elements | Dataford Interview Questions

A variant of LeetCode problem 49: given a list of integers, count the number of identical elements.

Implement count_identical_elements(nums). The input is a non-empty list of integers. Return a list of [value, count] pairs, sorted by value in ascending order. Each pair reports how many times that integer appears.

Constraints

1 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
Return one pair for each distinct integer
Output pairs must be sorted by integer value

Function Signature

def count_identical_elements(nums):

Your question is Count Identical Elements. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

A variant of LeetCode problem 49: given a list of integers, count the number of identical elements.

Constraints

1 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
Return one pair for each distinct integer
Output pairs must be sorted by integer value

Function Signature

def count_identical_elements(nums):

Your question is Count Identical Elements. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.