Dynamic Programming in Python, Part 2

Dynamic Programming holds 242 problems (9 Easy, 139 Medium, 94 Hard). Generate any of them into the current directory with lcpy gen -n <number>.

#	Problem	Difficulty	Solution
1395	Count Number of Teams	Medium	solution.py
1406	Stone Game III	Hard	solution.py
1425	Constrained Subsequence Sum	Hard	solution.py
1463	Cherry Pickup II	Hard	solution.py
1524	Number of Sub-arrays With Odd Sum	Medium	solution.py
1526	Minimum Number of Increments on Subarrays to Form a Target Array	Hard	solution.py
1531	String Compression II	Hard	solution.py
1547	Minimum Cost to Cut a Stick	Hard	solution.py
1553	Minimum Number of Days to Eat N Oranges	Hard	solution.py
1578	Minimum Time to Make Rope Colorful	Medium	solution.py
1611	Minimum One Bit Operations to Make Integers Zero	Hard	solution.py
1626	Best Team With No Conflicts	Medium	solution.py
1639	Number of Ways to Form a Target String Given a Dictionary	Hard	solution.py
1653	Minimum Deletions to Make String Balanced	Medium	solution.py
1671	Minimum Number of Removals to Make Mountain Array	Hard	solution.py
1749	Maximum Absolute Sum of Any Subarray	Medium	solution.py
1799	Maximize Score After N Operations	Hard	solution.py
1857	Largest Color Value in a Directed Graph	Hard	solution.py
1866	Number of Ways to Rearrange Sticks With K Sticks Visible	Hard	solution.py
1871	Jump Game VII	Medium	solution.py
1888	Minimum Number of Flips to Make the Binary String Alternating	Medium	solution.py
1911	Maximum Alternating Subsequence Sum	Medium	solution.py
1937	Maximum Number of Points with Cost	Medium	solution.py
1976	Number of Ways to Arrive at Destination	Medium	solution.py
2002	Maximum Product of the Length of Two Palindromic Subsequences	Medium	solution.py
2050	Parallel Courses III	Hard	solution.py
2127	Maximum Employees to Be Invited to a Meeting	Hard	solution.py
2140	Solving Questions With Brainpower	Medium	solution.py
2147	Number of Ways to Divide a Long Corridor	Hard	solution.py
2218	Maximum Value of K Coins From Piles	Hard	solution.py
2369	Check if There is a Valid Partition For The Array	Medium	solution.py
2370	Longest Ideal Subsequence	Medium	solution.py
2393	Count Strictly Increasing Subarrays	Medium	solution.py
2439	Minimize Maximum of Array	Medium	solution.py
2466	Count Ways To Build Good Strings	Medium	solution.py
2560	House Robber IV	Medium	solution.py
2597	The Number of Beautiful Subsets	Medium	solution.py
2616	Minimize the Maximum Difference of Pairs	Medium	solution.py
2707	Extra Characters in a String	Medium	solution.py
2742	Painting the Walls	Hard	solution.py
3068	Find the Maximum Sum of Node Values	Hard	solution.py
3434	Maximum Frequency After Subarray Operation	Medium	solution.py

Pages: 1, 2

Welcome

Getting Started

Practice

CLI

Catalog

Contributing

Troubleshooting

Dynamic Programming in Python, Part 2