**repartition(n)**: Full shuffle; increase or decrease partitions. Use when needing more parallelism or redistribute after skew. **coalesce(n)**: Reduces without full shuffle; merges adjacent. Use when reducing before write (e.g., fewer files). **Scalability**: repartition expensive; coalesce cheaper for reduction. **Cost**: coalesce(1) = single-partition bottleneck on large data—avoid....
The complete answer continues with detailed implementation patterns, architectural trade-offs, and production-grade considerations. It covers performance optimization strategies, common pitfalls to avoid, and real-world examples from companies like Capgemini. The answer also includes follow-up discussion points that interviewers commonly explore.
Continue Reading the Full Answer
Unlock the complete expert answer with code examples, trade-offs, and pro tips - plus 1,863+ more.
Or upgrade to Platform Pro - $39
Engineers who used these answers got offers at
AmazonDatabricksSnowflakeGoogleMeta
According to DataEngPrep.tech, this is one of the most frequently asked SQL interview questions, reported at 1 company. DataEngPrep.tech maintains a curated database of 1,863+ real data engineering interview questions across 7 categories, verified by industry professionals.