LeetCode: Minimum Cost Climbing Tree Clean Architecture: Chapter 22 - The dependency rule

• LeetCode: Minimum Cost Climbing Tree - It used 1 dimension dynamic programming. I’m still not sure how they come up with the answer.
• Clean architecture: Chapter 23 - Presenter and humble object - Humble object sounds humble but actually very complex