https://github.com/queraltsm/dynamicprogramming
Problems solved through tabulation and memoization techniques
https://github.com/queraltsm/dynamicprogramming
catalan dynamic-programming golomb maximum-product-cutting memoization newman-conway tabulation
Last synced: 7 months ago
JSON representation
Problems solved through tabulation and memoization techniques
- Host: GitHub
- URL: https://github.com/queraltsm/dynamicprogramming
- Owner: queraltsm
- Created: 2019-06-29T19:33:38.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2019-07-01T11:56:41.000Z (over 6 years ago)
- Last Synced: 2025-07-07T08:04:11.199Z (8 months ago)
- Topics: catalan, dynamic-programming, golomb, maximum-product-cutting, memoization, newman-conway, tabulation
- Language: Python
- Homepage: https://www.geeksforgeeks.org/dynamic-programming/
- Size: 17.6 KB
- Stars: 0
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
Dynamic Programming
Repository with different GeeksforGeeks's exercises resolved by dynamic programming.
- Golomb sequence: https://www.geeksforgeeks.org/golomb-sequence/
- Maximum Product Cutting: https://www.geeksforgeeks.org/maximum-product-cutting-dp-36/
- Newman-Conway Sequence: https://www.geeksforgeeks.org/newman-conway-sequence/
- nth Catalan Number: https://www.geeksforgeeks.org/program-nth-catalan-number/
Also two class exercises:
- V(n):

- V(n+1):

- d(m,n):
