Practice Tesla Coding Question | Real Coding Interviews | Hack2hire

NewML System Design & SQL tracks just landedSee what's new

Question Bank Pricing Blog Forum

Quick Summary

Model chunk distribution as directed acyclic graphs where edges represent data transfers.
Calculate each vehicle's contribution by counting how many downstream transfers it enables for every chunk.
Aggregate scores across all chunks and return vehicles sorted by score then ID.

What This Tests

Graph construction from event logs
Bottom-up aggregation using topological order or post-order traversal
Handling multiple independent subgraphs efficiently
Sorting with custom comparators

Common Patterns

Graph Traversal

DFS/BFS

Sorting

Hashing

Test Cases

Input

Output

Expected