1323. Maximum 69 Number
1323. Maximum 69 Number
class Solution:
def maximum69Number (self, num:
LeetCode
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
2244. Minimum Rounds to Complete All Tasks
2244. Minimum Rounds to Complete All Tasks
這一題可以算是經典的 Dynamic Programming
243. Shortest Word Distance
243. Shortest Word Distance
這是一個非常適合面試的題目，暴力法求解的方式也很簡單如下：
class Solution:
def shortestDistance(
1166. Design File System
1166. Design File System
這個題目滿好想到使用 Trie 的方式來實作的，不過邏輯上要注意幾點
1. 要如何確保
1926. Nearest Exit from Entrance in Maze
1926. Nearest Exit from Entrance in Maze
這個問題屬於 BFS 的問題