{"id":24762139,"url":"https://github.com/queraltsm/maximumprice","last_synced_at":"2025-03-23T13:28:06.803Z","repository":{"id":120661047,"uuid":"196182767","full_name":"queraltsm/MaximumPrice","owner":"queraltsm","description":"Maximum Price in not consecutive Boxes","archived":false,"fork":false,"pushed_at":"2019-07-15T22:49:34.000Z","size":34,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-28T19:35:39.540Z","etag":null,"topics":["brute-force","memoization","tabulation"],"latest_commit_sha":null,"homepage":null,"language":"Java","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-07-10T10:13:40.000Z","updated_at":"2019-07-15T22:49:36.000Z","dependencies_parsed_at":null,"dependency_job_id":"5ec026fb-f6a5-4a49-b246-756b6fb6e04d","html_url":"https://github.com/queraltsm/MaximumPrice","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/queraltsm%2FMaximumPrice","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/queraltsm%2FMaximumPrice/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/queraltsm%2FMaximumPrice/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/queraltsm%2FMaximumPrice/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/queraltsm","download_url":"https://codeload.github.com/queraltsm/MaximumPrice/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245107279,"owners_count":20561831,"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":["brute-force","memoization","tabulation"],"created_at":"2025-01-28T19:28:53.517Z","updated_at":"2025-03-23T13:28:06.794Z","avatar_url":"https://github.com/queraltsm.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003ch1\u003eMaximumPrice\u003c/h1\u003e\nWe have N boxes and inside which we can find money, and we have to calculate the maximum price of these\u003cbr\u003e\nconsidering that we can not select consecutive boxes.\u003cbr\u003e\n\u003cbr\u003eFor example:\u003cbr\u003e\nWe have 5 boxes -\u003e 3 2 10 1 5 \u003cbr\u003e\nThe result must be 18 (box 1 + box 3 + box 5)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fqueraltsm%2Fmaximumprice","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fqueraltsm%2Fmaximumprice","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fqueraltsm%2Fmaximumprice/lists"}