{"id":20248575,"url":"https://github.com/ndsvw/maximum-profit-problem","last_synced_at":"2026-06-05T03:32:00.442Z","repository":{"id":158830882,"uuid":"225434573","full_name":"ndsvw/Maximum-Profit-Problem","owner":"ndsvw","description":"Dynamic-Programming solution of the Maximum Profit Problem: Given an array of n integers representing a price of something over a time period: What is the maximum profit you can make by buying and selling at most k times?","archived":false,"fork":false,"pushed_at":"2019-12-28T21:26:36.000Z","size":152,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-14T02:25:55.181Z","etag":null,"topics":["algorithm","complexity-analysis","dynamic-programming","maximum-profit","price"],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ndsvw.png","metadata":{},"created_at":"2019-12-02T17:46:05.000Z","updated_at":"2023-08-08T20:30:18.000Z","dependencies_parsed_at":null,"dependency_job_id":"c078d4e1-af9c-4d37-9357-54ab1884c30b","html_url":"https://github.com/ndsvw/Maximum-Profit-Problem","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ndsvw%2FMaximum-Profit-Problem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ndsvw%2FMaximum-Profit-Problem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ndsvw%2FMaximum-Profit-Problem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ndsvw%2FMaximum-Profit-Problem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ndsvw","download_url":"https://codeload.github.com/ndsvw/Maximum-Profit-Problem/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241696170,"owners_count":20004745,"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","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":["algorithm","complexity-analysis","dynamic-programming","maximum-profit","price"],"created_at":"2024-11-14T09:48:40.976Z","updated_at":"2026-06-05T03:32:00.425Z","avatar_url":"https://github.com/ndsvw.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fndsvw%2Fmaximum-profit-problem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fndsvw%2Fmaximum-profit-problem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fndsvw%2Fmaximum-profit-problem/lists"}