Optimizing Large Dataset Scripts | Dataford Interview Questions

Given a large dataset, how would you optimize a script to reduce execution time?

Implement top_k_frequent(data, k) as a concrete version of the task. Return up to k values with the highest frequencies. Ties are selected by first appearance in data, and the returned values are sorted in ascending order. Use an algorithm that avoids sorting every distinct value when k is small.

Input: a list of integers and an integer k. Output: a list of integers.

Constraints

1 <= len(data) <= 300
1 <= k <= 300
-10^9 <= data[i] <= 10^9
k may be larger than the number of distinct values

Function Signature

def top_k_frequent(data, k):

Your question is Optimizing Large Dataset Scripts. 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

Given a large dataset, how would you optimize a script to reduce execution time?

Input: a list of integers and an integer k. Output: a list of integers.

Constraints

1 <= len(data) <= 300
1 <= k <= 300
-10^9 <= data[i] <= 10^9
k may be larger than the number of distinct values

Function Signature

def top_k_frequent(data, k):

Your question is Optimizing Large Dataset Scripts. 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.