Count Occurrences in Nested List | Dataford Interview Questions

Write a program to find the count of each number in a nested list.

Asked in the Coding stage. For input [1,[2,3],[1,4,4],5], return ((1,2),(2,1),(3,1),(4,2),(5,1)).

Contract

Implement count_numbers(nested_list). The input is a list containing integers and lists nested to arbitrary depth. Return a tuple of (number, count) pairs sorted by number. An empty input returns an empty tuple.

Constraints

The input contains only integers and lists.
Nesting depth is at most 1000.
The total number of integers is at most 10^5.
Return pairs sorted in ascending numeric order.

Function Signature

def count_numbers(nested_list):

Your question is Count Occurrences in Nested List. 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