2187. Minimum Time to Complete Trips
2187. Minimum Time to Complete Trips
class Solution:
def minimumTime(
Binary Search
1870. Minimum Speed to Arrive on Time
1870. Minimum Speed to Arrive on Time
這個題目有幾個要注意的地方
1. 不管速度多快可以抵達一個地方，
1631. Path With Minimum Effort
1631. Path With Minimum Effort
這個題目算是比較變態的一題，但是絕對是面試時間內做得出來的題目，要會這題一定要先做過 875. Koko
1283. Find the Smallest Divisor Given a Threshold
1283. Find the Smallest Divisor Given a Threshold
這題只要先做過 875.
2300. Successful Pairs of Spells and Potions
2300. Successful Pairs of Spells and Potions
class Solution:
def
74. Search a 2D Matrix
74. Search a 2D Matrix
class Solution:
def searchMatrix(self,
410. Split Array Largest Sum
410. Split Array Largest Sum
原題： 1011. Capacity To Ship
702. Search in a Sorted Array of Unknown Size
702. Search in a Sorted Array of Unknown Size
這個題目的主要考察點是要如何先確定邊界，
658. Find K Closest Elements
658. Find K Closest Elements
這個題目是給定一個點 x，要找出最接近的 k 個點，
4. Median of Two Sorted Arrays
4. Median of Two Sorted Arrays
這個題目直覺的解法很簡單，做法也很多種，因為題目的邏輯很簡單，就是要找到中位數。