© 2018 - current, Volkan Sonmez, www.pythonicfool.com
This is a repository of teaching materials, code, and data for my data analysis and machine learning projects.
Each repository will (usually) correspond to one of the posts on my website.
You are free to:
- Share—copy and redistribute the material in any medium or format
- Adapt—remix, transform, and build upon the material
Under the following terms:
- Attribution—You must give appropriate credit (mentioning that your work is derived from work that is © Volkan Sonmez and, where practical, linking to http://www.pythonicfool.com/), and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use. LICENSE
Beginner, Intermediate, and Advanced Level Examples (Recursions and Dynamic Programming)
Recursive solutions applied to several permutation and combination problems
- Longest Common Substring,
- Longest Common Subsequence,
- Min Coin Change Problem,
- All Ways to Reach a Target,
- Knapsack Value Optimization,
- Longest Increasing Subsequence,
- Longest Common Increasing Subsequence,
- Edit Distance (The Levenshtein Distance) Problem,
- Min Number of Scalar Multiplications for Chain Multiplication of Matrices,
- Partition Problem,
- Max Profit on Rod Cutting Problem,
- Word Break (Segmentation) Problem,
- Matrix Rotation Operations,
- Min Insertions for a Palindrome,
- Max Profit with K-transactions of Stock Prices,
- Shortest Supersequence,
- Min Cost to Reach a Target with given Sum or Multiplication Costs,
- Max Chain Length of Connectible Tuples,
- Max Sum Increasing Subsequence,
- Min Jumps to Reach a Target,
- Number of Paths on a Table from One Corner to Another,
- Coin Pick Game to Earn Most,
- Finding Sum Subset List to Reach a Target,
- Finding Two Equal Sum Subset,
- Word Break Problem Revisited.