1870. Minimum Speed to Arrive on Time
1870. Minimum Speed to Arrive on Time
這個題目有幾個要注意的地方
1. 不管速度多快可以抵達一個地方，
LeetCode
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.
1338. Reduce Array Size to The Half
1338. Reduce Array Size to The Half
class Solution:
def
1323. Maximum 69 Number
1323. Maximum 69 Number
class Solution:
def maximum69Number (self, num:
2101. Detonate the Maximum Bombs
2101. Detonate the Maximum Bombs
class Solution:
def maximumDetonation(self,
1306. Jump Game III
1306. Jump Game III
class Solution:
def canReach(self, arr:
433. Minimum Genetic Mutation
433. Minimum Genetic Mutation
class Solution:
def minMutation(self, startGene:
150. Evaluate Reverse Polish Notation
150. Evaluate Reverse Polish Notation
這個題目是屬於如何使用 Stack 來紀錄處理四則運算的方法。Wiki：逆波蘭表示法，
244. Shortest Word Distance II
244. Shortest Word Distance II
參考： 243. Shortest Word Distance