Greedy Algorithms - Two City Scheduling
Given the following code and input, what is the returned total cost?
Given the following code and input, what is the returned total cost?
easy🧾 Code Trace Q3 of Q15
Step-by-Step Solution
Solution:
Step 1: Sort costs by difference (costA - costB)
Sorted order: [10,20], [30,20], [400,50], [30,200]Step 2: Assign first n=2 to city A, rest to city B and sum costs
City A: 10 + 30 = 40; City B: 50 + 20 = 70; Total = 110Final Answer:
Option B -> Option BQuick Check:
Correct sorting and assignment yields 110 [OK]
Quick Trick: Sort by cost difference, assign first half to city A [OK]
Common Mistakes:
MISTAKES- Not sorting by difference
- Assigning wrong half to city A
- Off-by-one in loop
Trap Explanation:
PITFALL- Candidates often forget to sort or misassign halves causing wrong totals.
Interviewer Note:
CONTEXT- Tests ability to trace greedy code on canonical input
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