New
The Learning module is now live
See what's new
×
Question Bank
Learning
NEW
Pricing
Blog
Forum
HOT
JobRadar
Description
Solution
Discussion
Submissions
Ask AI
Question Bank
Coding Question
AI Insights
Quick Summary
Partition an array of module difficulties into three non-empty groups assigned to distinct servers.
For each partition, determine the minimum possible deployment difficulty across all valid triple selections.
Find the partition configuration that maximizes this minimum deployment difficulty.
What This Tests
Array sorting and sequence manipulation
Mathematical simplification of absolute difference expressions
Greedy boundary selection in sorted data
Constrained partitioning logic
Common Patterns
Sorting
Greedy
Math
Collapse
Hint 1
Hint 2
What Interviewers May Ask Next
Accepted
10
/26
Acceptance Rate
38.5%
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
Qwen
Qwen3.6-Flash
0/2000
Auto
Debug
Run
Submit
Test Cases
Input
difficulty =
Output
Expected
