Daily Question – *0787. Cheapest Flights Within K Stops
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).
Daily Question – 0997. Find the Town Judge
Description: https://leetcode.com/problems/find-the-town-judge/ Notes:
Daily Question – 0268. Missing Number
Description: https://leetcode.com/problems/missing-number/description/ Notes:
Daily Question – 0231. Power of Two
Descroption: https://leetcode.com/problems/power-of-two/ Note
19. Remove Nth Node From End of List
Description: https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/ Notes:
Daily Question – 1642. Furthest Building You Can Reach
Greedy, use list.poll get the least number of integer list.
Daily Question – 1481. Least Number of Unique Integers after K Removals
Greedy Greedy Greedy.