{"id":24762153,"url":"https://github.com/queraltsm/dynamicprogramming","last_synced_at":"2025-08-12T02:16:52.941Z","repository":{"id":120661019,"uuid":"194441929","full_name":"queraltsm/DynamicProgramming","owner":"queraltsm","description":"Problems solved through tabulation and memoization techniques","archived":false,"fork":false,"pushed_at":"2019-07-01T11:56:41.000Z","size":18,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-07-07T08:04:11.199Z","etag":null,"topics":["catalan","dynamic-programming","golomb","maximum-product-cutting","memoization","newman-conway","tabulation"],"latest_commit_sha":null,"homepage":"https://www.geeksforgeeks.org/dynamic-programming/","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/queraltsm.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-06-29T19:33:38.000Z","updated_at":"2019-07-01T11:56:43.000Z","dependencies_parsed_at":"2023-03-13T12:34:08.841Z","dependency_job_id":null,"html_url":"https://github.com/queraltsm/DynamicProgramming","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/queraltsm/DynamicProgramming","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/queraltsm%2FDynamicProgramming","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/queraltsm%2FDynamicProgramming/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/queraltsm%2FDynamicProgramming/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/queraltsm%2FDynamicProgramming/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/queraltsm","download_url":"https://codeload.github.com/queraltsm/DynamicProgramming/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/queraltsm%2FDynamicProgramming/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":269987155,"owners_count":24508182,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-12T02:00:09.011Z","response_time":80,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["catalan","dynamic-programming","golomb","maximum-product-cutting","memoization","newman-conway","tabulation"],"created_at":"2025-01-28T19:28:53.961Z","updated_at":"2025-08-12T02:16:52.904Z","avatar_url":"https://github.com/queraltsm.png","language":"Python","readme":"\u003ch1\u003eDynamic Programming\u003c/h1\u003e\nRepository with different GeeksforGeeks's exercises resolved by dynamic programming.\u003cbr\u003e\n\u003cbr\u003e\n- Golomb sequence: https://www.geeksforgeeks.org/golomb-sequence/ \u003cbr\u003e\n- Maximum Product Cutting: https://www.geeksforgeeks.org/maximum-product-cutting-dp-36/ \u003cbr\u003e\n- Newman-Conway Sequence: https://www.geeksforgeeks.org/newman-conway-sequence/ \u003cbr\u003e\n- nth Catalan Number: https://www.geeksforgeeks.org/program-nth-catalan-number/ \u003cbr\u003e\n\n\u003cbr\u003eAlso two class exercises:\u003cbr\u003e\n\n- V(n):\u003cbr\u003e\n\n![Captura de pantalla 2019-06-30 a las 22 56 02](https://user-images.githubusercontent.com/26334453/60402645-43fda800-9b8a-11e9-9154-75d8ae054119.png)\n\n- V(n+1):\u003cbr\u003e\n\n![Captura de pantalla 2019-06-30 a las 22 56 53](https://user-images.githubusercontent.com/26334453/60402876-4ca3ad80-9b8d-11e9-969d-d632dddcf0dd.png)\n\n- d(m,n): \u003cbr\u003e\n\n![Captura de pantalla 2019-06-30 a las 22 54 12](https://user-images.githubusercontent.com/26334453/60402623-03059380-9b8a-11e9-842e-96dd17d89f40.png)\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fqueraltsm%2Fdynamicprogramming","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fqueraltsm%2Fdynamicprogramming","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fqueraltsm%2Fdynamicprogramming/lists"}