{"action":"created","issue":{"url":"https://api.github.com/repos/rgehan/hacktoberfest-2k18-katas/issues/760","repository_url":"https://api.github.com/repos/rgehan/hacktoberfest-2k18-katas","labels_url":"https://api.github.com/repos/rgehan/hacktoberfest-2k18-katas/issues/760/labels{/name}","comments_url":"https://api.github.com/repos/rgehan/hacktoberfest-2k18-katas/issues/760/comments","events_url":"https://api.github.com/repos/rgehan/hacktoberfest-2k18-katas/issues/760/events","html_url":"https://github.com/rgehan/hacktoberfest-2k18-katas/issues/760","id":369977793,"node_id":"MDU6SXNzdWUzNjk5Nzc3OTM=","number":760,"title":"Implement minMaxSum","user":{"login":"Brand-Temp","id":18414261,"node_id":"MDQ6VXNlcjE4NDE0MjYx","avatar_url":"https://avatars1.githubusercontent.com/u/18414261?v=4","gravatar_id":"","url":"https://api.github.com/users/Brand-Temp","html_url":"https://github.com/Brand-Temp","followers_url":"https://api.github.com/users/Brand-Temp/followers","following_url":"https://api.github.com/users/Brand-Temp/following{/other_user}","gists_url":"https://api.github.com/users/Brand-Temp/gists{/gist_id}","starred_url":"https://api.github.com/users/Brand-Temp/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Brand-Temp/subscriptions","organizations_url":"https://api.github.com/users/Brand-Temp/orgs","repos_url":"https://api.github.com/users/Brand-Temp/repos","events_url":"https://api.github.com/users/Brand-Temp/events{/privacy}","received_events_url":"https://api.github.com/users/Brand-Temp/received_events","type":"User","site_admin":false},"labels":[{"id":1076825064,"node_id":"MDU6TGFiZWwxMDc2ODI1MDY0","url":"https://api.github.com/repos/rgehan/hacktoberfest-2k18-katas/labels/assigned","name":"assigned","color":"b73714","default":false},{"id":1091621433,"node_id":"MDU6TGFiZWwxMDkxNjIxNDMz","url":"https://api.github.com/repos/rgehan/hacktoberfest-2k18-katas/labels/assignee:rinkevich","name":"assignee:rinkevich","color":"ededed","default":false},{"id":1076812681,"node_id":"MDU6TGFiZWwxMDc2ODEyNjgx","url":"https://api.github.com/repos/rgehan/hacktoberfest-2k18-katas/labels/hacktoberfest","name":"hacktoberfest","color":"b8a7e5","default":false}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":5,"created_at":"2018-10-15T02:41:56Z","updated_at":"2018-10-16T11:35:08Z","closed_at":null,"author_association":"CONTRIBUTOR","body":"# minMaxSum\r\n\r\n### Link to the PR that adds this test case:\r\n\r\n#761 \r\n\r\n### Where to implement:\r\n\r\n`src/minMaxSum.js`\r\n\r\n### Where are the tests:\r\n\r\n`src/minMaxSum.test.js`\r\n\r\n### Description (optinal)\r\n\r\nImplement an algorithm which sums the smallest and largest numbers in an array.\r\n\r\n---\r\n\r\n# If you want to take on this issue:\r\n\r\n- Check that the kata is labelled \"up for grabs\"\r\n- If no one is assigned to the issue, reply with `/request` to ask for it\r\n- Create a Pull Request with the 3 following changes:\r\n  - A fixed implementation of the function (for example: `src/theFunction.js`)\r\n  - A new kata test file with real test cases (for example: `src/newKata.test.js`)\r\n  - A new kata empty method stub (for example: `src/newKata.js`)\r\n\r\nPlease see the [README](https://github.com/rgehan/hacktoberfest-2k18-katas/blob/master/README.md) for more details about the rules.\r\n\r\n:warning: If your PR is not following the above rules, it will be closed immediately, and tagged as `invalid`, meaning that it won't count in your Hacktoberfest's PRs :warning:\r\n"},"comment":{"url":"https://api.github.com/repos/rgehan/hacktoberfest-2k18-katas/issues/comments/430203522","html_url":"https://github.com/rgehan/hacktoberfest-2k18-katas/issues/760#issuecomment-430203522","issue_url":"https://api.github.com/repos/rgehan/hacktoberfest-2k18-katas/issues/760","id":430203522,"node_id":"MDEyOklzc3VlQ29tbWVudDQzMDIwMzUyMg==","user":{"login":"cori","id":46317,"node_id":"MDQ6VXNlcjQ2MzE3","avatar_url":"https://avatars1.githubusercontent.com/u/46317?v=4","gravatar_id":"","url":"https://api.github.com/users/cori","html_url":"https://github.com/cori","followers_url":"https://api.github.com/users/cori/followers","following_url":"https://api.github.com/users/cori/following{/other_user}","gists_url":"https://api.github.com/users/cori/gists{/gist_id}","starred_url":"https://api.github.com/users/cori/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/cori/subscriptions","organizations_url":"https://api.github.com/users/cori/orgs","repos_url":"https://api.github.com/users/cori/repos","events_url":"https://api.github.com/users/cori/events{/privacy}","received_events_url":"https://api.github.com/users/cori/received_events","type":"User","site_admin":false},"created_at":"2018-10-16T11:35:08Z","updated_at":"2018-10-16T11:35:08Z","author_association":"NONE","body":"I'd be interested in implementing this kata, but the test cases don't make sense to me.\r\n\r\nFor instance in the final test case, minMaxSum of the smallest and largest numbers in `[10, 6, 23, 7, 12, -4, 0, -12]` it seems like the sum of the smallest (`-12`) and largest (`23`) numbers should be `11`, not `13`. And for the last case the minMaxSum of `[-1, -5, -20, -6, -9]` seems like it should be `-21`, not `-12`.\r\n\r\nSo I'm afraid either I misunderstand the requirements of the kata or my solution wouldn't pass the tests."}}
{"actor":{"display_login":"cori"}}