1676. Lowest Common Ancestor of a Binary Tree IV
1676. Lowest Common Ancestor of a Binary Tree IV
Check
LeetCode
1650. Lowest Common Ancestor of a Binary Tree III
1650. Lowest Common Ancestor of a Binary Tree III
Check
1644. Lowest Common Ancestor of a Binary Tree II
1644. Lowest Common Ancestor of a Binary Tree II
Check
236. Lowest Common Ancestor of a Binary Tree
236. Lowest Common Ancestor of a Binary Tree
Check 235.
235. Lowest Common Ancestor of a Binary Search Tree
* 235. Lowest Common Ancestor of a Binary Search Tree
* 236.
18. 4 Sum
18. 4 Sum
Check 15. 3 Sum
887. Super Egg Drop
887. Super Egg Drop
參考 1884. Egg Drop With 2
5. Longest Palindromic Substring
5. Longest Palindromic Substring
這一題是我們要找出子字串中的最長的回文，其實最好從暴力解法開始學習起，前面的題目已經重複提過了好多次的回文的性質，這裡就用暴力法先來思考以下。
暴力法 (TLE)
435. Non-overlapping Intervals
435. Non-overlapping Intervals
這一題比前面的系列題目還稍難一點，但是思維很像一樣需要先將時間區間排序好，接著的目標是要找到移除幾個區間才能讓所有的會議都沒有重複的時間，這一題不能先把可以合併的時間都合併起來，因為當我們都合併起來之後，就會找不到到底哪一個需要被合併。
當所有的區間都按照順序排好後，
989. Add to Array-Form of Integer
989. Add to Array-Form of Integer
class Solution:
def addToArrayForm(