{"id":20053212,"url":"https://github.com/romalev/rx-packer","last_synced_at":"2025-09-15T08:48:07.682Z","repository":{"id":127866469,"uuid":"113065152","full_name":"romalev/rx-packer","owner":"romalev","description":"Solving packaging challenge. See README for more details.","archived":false,"fork":false,"pushed_at":"2017-12-11T15:10:29.000Z","size":54,"stargazers_count":1,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-17T07:47:53.780Z","etag":null,"topics":["algorithm-challenges","concurrency","concurrent-programming","java8","mvn","rxjava2"],"latest_commit_sha":null,"homepage":"","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/romalev.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":"2017-12-04T16:14:10.000Z","updated_at":"2019-04-15T10:19:27.000Z","dependencies_parsed_at":null,"dependency_job_id":"f50fe80e-2baa-4f9f-b756-9666961c5d02","html_url":"https://github.com/romalev/rx-packer","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/romalev/rx-packer","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/romalev%2Frx-packer","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/romalev%2Frx-packer/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/romalev%2Frx-packer/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/romalev%2Frx-packer/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/romalev","download_url":"https://codeload.github.com/romalev/rx-packer/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/romalev%2Frx-packer/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":275232279,"owners_count":25428224,"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-09-15T02:00:09.272Z","response_time":75,"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":["algorithm-challenges","concurrency","concurrent-programming","java8","mvn","rxjava2"],"created_at":"2024-11-13T12:23:35.688Z","updated_at":"2025-09-15T08:48:07.626Z","avatar_url":"https://github.com/romalev.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"***Package Challenge***\n-\n**Introduction**\n\nImagine you want to send your friend a package with different things.\nEach thing you put inside the package has such parameters as index number, weight and cost. The\npackage has a weight limit. Goal is to determine which things to put into the package so that the\ntotal weight is less than or equal to the package limit and the total cost is as large as possible.\nYou would prefer to send a package which weights less in case there is more than one package with the\nsame price.\n\n**Input sample**\n\nProgram accepts as its first argument a path to a filename. The input file contains several\nlines. Each line is one test case.\nEach line contains the weight that the package can take (before the colon) and the list of things you\nneed to choose. Each thing is enclosed in parentheses where the 1st number is a thing's index number,\nthe 2nd is its weight and the 3rd is its cost. \nE.g.\n\n`81 : (1,53.38,€45) (2,88.62,€98) (3,78.48,€3) (4,72.30,€76) (5,30.18,€9)\n(6,46.34,€48) `\n\n`8 : (1,15.3,€34)`\n\n`75 : (1,85.31,€29) (2,14.55,€74) (3,3.98,€16) (4,26.24,€55) (5,63.69,€52)\n(6,76.25,€75) (7,60.02,€74) (8,93.18,€35) (9,89.95,€78)`\n\n`56 : (1,90.72,€13) (2,33.80,€40) (3,43.15,€10) (4,37.97,€16) (5,46.81,€36)\n(6,48.77,€79) (7,81.80,€45) (8,19.36,€79) (9,6.76,€64)`\n\n**Output sample**\n\nFor each set of things that you put into the package provide a list (items’ index numbers are separated\nby comma). E.g.\n\n`4`\n\n--\n\n`2,7`\n\n`8,9`\n\n_Additional constraints:_\n1. Max weight that a package can take is ≤ 100\n2. There might be up to 15 items you need to choose from\n3. Max weight and cost of an item is ≤ 100\n\n**Notes**\n\nRxJava is considered as backbone to drive the solution for task described above.\n\n\n_Things to be improved:_ \n* utilize the power of eclipse collection. \n* Read a file in a truly async way.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fromalev%2Frx-packer","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fromalev%2Frx-packer","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fromalev%2Frx-packer/lists"}