Skip to content

Files

Latest commit

103style103style
Update 91. Decode Ways.md
Apr 21, 2021
fa73923 · Apr 21, 2021

History

History

Dynamic Programming

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
1000. Minimum Cost to Merge Stones.md
1000. Minimum Cost to Merge Stones.md
 
 
1024. Video Stitching.md
1024. Video Stitching.md
 
 
1025. Divisor Game.md
1025. Divisor Game.md
 
 
1039. Minimum Score Triangulation of Polygon.md
1039. Minimum Score Triangulation of Polygon.md
 
 
1140. Stone Game II.md
1140. Stone Game II.md
 
 
1143. Longest Common Subsequence.md
1143. Longest Common Subsequence.md
 
 
1155. Number of Dice Rolls With Target Sum.md
1155. Number of Dice Rolls With Target Sum.md
 
 
120. Triangle.md
120. Triangle.md
 
 
123. Best Time to Buy and Sell Stock III.md
123. Best Time to Buy and Sell Stock III.md
 
 
1314. Matrix Block Sum.md
1314. Matrix Block Sum.md
 
 
132. Palindrome Partitioning II.md
132. Palindrome Partitioning II.md
 
 
1340. Jump Game V.md
1340. Jump Game V.md
 
 
139. Word Break.md
139. Word Break.md
 
 
140. Word Break II.md
140. Word Break II.md
 
 
1406. Stone Game III.md
1406. Stone Game III.md
 
 
1425. Constrained Subsequence Sum.md
1425. Constrained Subsequence Sum.md
 
 
1458. Max Dot Product of Two Subsequences.md
1458. Max Dot Product of Two Subsequences.md
 
 
1473. Paint House III.md
1473. Paint House III.md
 
 
1483. Kth Ancestor of a Tree Node.md
1483. Kth Ancestor of a Tree Node.md
 
 
1504. Count Submatrices With All Ones.md
1504. Count Submatrices With All Ones.md
 
 
1510. Stone Game IV.md
1510. Stone Game IV.md
 
 
152. Maximum Product Subarray.md
152. Maximum Product Subarray.md
 
 
1531. String Compression II.md
1531. String Compression II.md
 
 
1537. Get the Maximum Score.md
1537. Get the Maximum Score.md
 
 
1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target.md
1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target.md
 
 
1547. Minimum Cost to Cut a Stick.md
1547. Minimum Cost to Cut a Stick.md
 
 
1553. Minimum Number of Days to Eat N Oranges.md
1553. Minimum Number of Days to Eat N Oranges.md
 
 
1563. Stone Game V.md
1563. Stone Game V.md
 
 
1569. Number of Ways to Reorder Array to Get Same BST.md
1569. Number of Ways to Reorder Array to Get Same BST.md
 
 
1575. Count All Possible Routes.md
1575. Count All Possible Routes.md
 
 
1594. Maximum Non Negative Product in a Matrix.md
1594. Maximum Non Negative Product in a Matrix.md
 
 
1595. Minimum Cost to Connect Two Groups of Points.md
1595. Minimum Cost to Connect Two Groups of Points.md
 
 
1601. Maximum Number of Achievable Transfer Requests.md
1601. Maximum Number of Achievable Transfer Requests.md
 
 
1639. Number of Ways to Form a Target String Given a Dictionary.md
1639. Number of Ways to Form a Target String Given a Dictionary.md
 
 
1664. Ways to Make a Fair Array.md
1664. Ways to Make a Fair Array.md
 
 
1671. Minimum Number of Removals to Make Mountain Array.md
1671. Minimum Number of Removals to Make Mountain Array.md
 
 
174. Dungeon Game.md
174. Dungeon Game.md
 
 
1799. Maximize Score After N Operations.md
1799. Maximize Score After N Operations.md
 
 
188. Best Time to Buy and Sell Stock IV.md
188. Best Time to Buy and Sell Stock IV.md
 
 
198. House Robber.md
198. House Robber.md
 
 
213. House Robber II.md
213. House Robber II.md
 
 
221. Maximal Square.md
221. Maximal Square.md
 
 
279. Perfect Squares.md
279. Perfect Squares.md
 
 
303. Range Sum Query - Immutable.md
303. Range Sum Query - Immutable.md
 
 
309. Best Time to Buy and Sell Stock with Cooldown.md
309. Best Time to Buy and Sell Stock with Cooldown.md
 
 
312. Burst Balloons.md
312. Burst Balloons.md
 
 
322. Coin Change.md
322. Coin Change.md
 
 
338. Counting Bits.md
338. Counting Bits.md
 
 
368. Largest Divisible Subset.md
368. Largest Divisible Subset.md
 
 
44. Wildcard Matching.md
44. Wildcard Matching.md
 
 
486. Predict the Winner.md
486. Predict the Winner.md
 
 
494. Target Sum.md
494. Target Sum.md
 
 
518. Coin Change 2.md
518. Coin Change 2.md
 
 
53. Maximum Subarray.md
53. Maximum Subarray.md
 
 
546. Remove Boxes.md
546. Remove Boxes.md
 
 
63. Unique Paths II.md
63. Unique Paths II.md
 
 
64. Minimum Path Sum.md
64. Minimum Path Sum.md
 
 
646. Maximum Length of Pair Chain.md
646. Maximum Length of Pair Chain.md
 
 
673. Number of Longest Increasing Subsequence.md
673. Number of Longest Increasing Subsequence.md
 
 
70. Climbing Stairs.md
70. Climbing Stairs.md
 
 
714. Best Time to Buy and Sell Stock with Transaction Fee.md
714. Best Time to Buy and Sell Stock with Transaction Fee.md
 
 
718. Maximum Length of Repeated Subarray.md
718. Maximum Length of Repeated Subarray.md
 
 
741. Cherry Pickup.md
741. Cherry Pickup.md
 
 
818. Race Car.md
818. Race Car.md
 
 
837. New 21 Game.md
837. New 21 Game.md
 
 
877. Stone Game.md
877. Stone Game.md
 
 
91. Decode Ways.md
91. Decode Ways.md
 
 
943. Find the Shortest Superstring.md
943. Find the Shortest Superstring.md
 
 
95. Unique Binary Search Trees II.md
95. Unique Binary Search Trees II.md
 
 
96. Unique Binary Search Trees.md
96. Unique Binary Search Trees.md
 
 
967. Numbers With Same Consecutive Differences.md
967. Numbers With Same Consecutive Differences.md
 
 
97. Interleaving String.md
97. Interleaving String.md
 
 
983. Minimum Cost For Tickets.md
983. Minimum Cost For Tickets.md
 
 
README.md
README.md