Fixing Memory Issues in Containers | Dataford Interview Questions

How do you optimize a piece of code that is consuming excessive memory in a containerized environment?

Implement count_distinct_sorted(numbers) so it counts distinct values without copying the input or storing all previously seen values. The input is a nondecreasing list of integers, and the function returns an integer count.

Constraints

0 <= len(numbers) <= 5000
numbers is sorted in nondecreasing order
-10^9 <= numbers[i] <= 10^9

Function Signature

def count_distinct_sorted(numbers):

Your question is Fixing Memory Issues in Containers. 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

How do you optimize a piece of code that is consuming excessive memory in a containerized environment?

Constraints

0 <= len(numbers) <= 5000
numbers is sorted in nondecreasing order
-10^9 <= numbers[i] <= 10^9

Function Signature

def count_distinct_sorted(numbers):

Your question is Fixing Memory Issues in Containers. 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.