Category: greedy

• LeetCode 1029: Two City Scheduling

  link Brute force Try flying each person to city A and city B and take the minimum cost. Time: , space: . Greedy For a cost pair , when we decide to fly a person to city A, we are also deciding to not fly that person to city B. We have to optimize both…

  tanvirdotzaman

  May 2, 2025

  foundational_interview, greedy