$ cat ./coding/README.md
[#]Coding
────────────────────────────────────────────────────────────
--filterallArrayBacktrackBinary SearchBit ManipulationClassicDesignDynamic ProgrammingGraphGreedyHash TableHeapInorder TraversalIntervalsLinked ListMathMetaMonotonicObject Oriented DesignOtherPostorder TraversalPrefix SumPreorder TraversalQueueRecursionSliding WindowSortingStackStringTreeTrieTwo PointersUnionFind
265. Paint House II#Dynamic Programming256. Paint House#Dynamic Programming2244. Minimum Rounds to Complete All Tasks#Dynamic Programming1751. Maximum Number of Events That Can Be Attended II#Dynamic Programming931. Minimum Falling Path Sum#Dynamic Programming63. Unique Paths II#Dynamic Programming2218. Maximum Value of K Coins From Piles#Dynamic Programming787. Cheapest Flights Within K Stops#Graph #Dynamic Programming276. Paint Fence#Dynamic Programming1335. Minimum Difficulty of a Job Schedule#Dynamic Programming1770. Maximum Score from Performing Multiplication Operations#Dynamic Programming740. Delete and Earn#Dynamic Programming1137. N-th Tribonacci Number#Dynamic Programming746. Min Cost Climbing Stairs#Dynamic Programming5. Longest Palindromic Substring#Two Pointers #Dynamic Programming121. Best Time to Buy and Sell Stock#Dynamic Programming #Classic139. Word Break#Backtrack #Dynamic Programming188. Best Time to Buy and Sell Stock IV#Dynamic Programming #Classic140. Word Break II#Backtrack #Dynamic Programming322. Coin Change#Dynamic Programming