Top Distinct Distances in Pyspark | Dataford Interview Questions

Pyspark question: Trips data: rider_id,client_id,start_time,end_time,vehicle_id,distance - return top 10 customers who has longest distance travelled

Asked in the technical_round_2 stage, as reported in the second EPAM onsite interview post.

Implement the equivalent algorithm as top_customers(trips). Each trip is a dictionary with integer rider_id, client_id, and vehicle_id, plus a nonnegative numeric distance. Return up to 10 [client_id, total_distance] pairs, ordered by total distance descending, then client ID ascending for ties.

Constraints

0 <= len(trips) <= 1000
Each trip contains integer client_id and nonnegative numeric distance fields
0 <= distance <= 10^9
The result contains at most 10 clients

Function Signature

def top_customers(trips):

Your question is Top Distinct Distances in Pyspark. 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

Pyspark question: Trips data: rider_id,client_id,start_time,end_time,vehicle_id,distance - return top 10 customers who has longest distance travelled

Asked in the technical_round_2 stage, as reported in the second EPAM onsite interview post.

Constraints

0 <= len(trips) <= 1000
Each trip contains integer client_id and nonnegative numeric distance fields
0 <= distance <= 10^9
The result contains at most 10 clients

Function Signature

def top_customers(trips):

Your question is Top Distinct Distances in Pyspark. 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.