Dijkstra

Q1: https://leetcode.com/problems/score-of-a-string/ Q2: https://leetcode.com/problems/minimum-rectangles-to-cover-points/ Notes: The y values don’t matter; only the x values matter. Q3: https://leetcode.com/problems/minimum-time-to-visit-disappearing-nodes/description/ Notes: Use Dijkstra’s...

This is a typical graph theory problem that could be solved by using the Dijkstra algorithm. Since it has a limitation, we could use the SPFA (Shortest Path Faster Algorithm).