Greedy Algorithms - Two City Scheduling
What is the time complexity of the optimal greedy solution for Two City Scheduling that sorts by cost difference and assigns people in one pass?
What is the time complexity of the optimal greedy solution for Two City Scheduling that sorts by cost difference and assigns people in one pass?
medium🪤 Complexity Trap Q5 of Q15
Step-by-Step Solution
Solution:
Step 1: Analyze sorting step
Sorting costs by difference takes O(n log n) time.Step 2: Analyze assignment step
Single pass assignment is O(n), dominated by sorting.Final Answer:
Option B -> Option BQuick Check:
Sorting dominates time complexity [OK]
Quick Trick: Sorting dominates time, assignment is linear [OK]
Common Mistakes:
MISTAKES- Confusing with exponential brute force
- Assuming linear only
- Mistaking nested loops for assignment
Trap Explanation:
PITFALL- Candidates often forget sorting cost and pick linear or quadratic incorrectly.
Interviewer Note:
CONTEXT- Tests understanding of time complexity in greedy approach
Master "Two City Scheduling" in Greedy Algorithms
Want More Practice?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All QuestionsMore Greedy Algorithms Quizzes