@@ -133,6 +133,29 @@ The improved way with a queue is commonly more efficient. Relaxing **All Edges**
133133- 376https://leetcode.cn/problems/wiggle-subsequence/
134134- 53https://leetcode.cn/problems/maximum-subarray/
135135- 122https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/
136+ - 55https://leetcode.cn/problems/jump-game/
137+ - 45https://leetcode.cn/problems/jump-game-ii/
138+ - 1005https://leetcode.cn/problems/maximize-sum-of-array-after-k-negations/
139+ - 135https://leetcode.cn/problems/candy/
140+ - 860https://leetcode.cn/problems/lemonade-change/
141+ - 406https://leetcode.cn/problems/queue-reconstruction-by-height/
142+ - 452https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons
143+ - 435https://leetcode.cn/problems/non-overlapping-intervals/
144+ - 763https://leetcode.cn/problems/partition-labels/
145+ - 56https://leetcode.cn/problems/merge-intervals/
146+ - 738https://leetcode.cn/problems/monotone-increasing-digits/
147+ - 968https://leetcode.cn/problems/binary-tree-cameras/
148+
149+ ###Dynamic programming
150+ - 70https://leetcode.cn/problems/climbing-stairs/
151+ - 746https://leetcode.cn/problems/min-cost-climbing-stairs/
152+ - 62https://leetcode.cn/problems/unique-paths/
153+ - 63https://leetcode.cn/problems/unique-paths-ii/
154+ - 343https://leetcode.cn/problems/integer-break/
155+
156+ ####backpack problems
157+ - 279https://leetcode.cn/problems/perfect-squares/ can have solution 2
158+ -
136159
137160###Failed in 2 rounds
138161- 222https://leetcode.cn/problems/count-complete-tree-nodes/
@@ -142,5 +165,6 @@ The improved way with a queue is commonly more efficient. Relaxing **All Edges**
142165- 332https://leetcode.cn/problems/reconstruct-itinerary/
143166- 51https://leetcode.cn/problems/n-queens/
144167- 37https://leetcode.cn/problems/sudoku-solver
168+ - 96https://leetcode.cn/problems/unique-binary-search-trees/ Finished but slow.
145169
146- 2005-02-04 day7
170+ 2005-02-07 day4