Closed nathany closed 2 years ago
In perl mongers we golfed sometimes:
http://web.archiveorange.com/archive/v/4cYGkZtmChhUcagaHtbP
Go golfs could be cool since there are numerous ways to solve the problem.
So would we pick a problem from Project Euler, Exercism or similar and all try to solve it to see what people come up with? I've not "golfed".
Sure. I recommend problems with search or problems that could benefit from concurrency or a workers/channels model. But yeah. Often you choose a small achievable problem and then a few evaluation measures (code size, speed, memory, interestingness, use of channels, etc.) and let people explore a directions and then do show and tell.
I remember codility had the time and memory constraints on its problems like that. I've added it to the list.
@abramhindle Would you like to host "Go golfing", providing 2-3 problems and showing the algorithms? We could give more time than the usual 20-minutes so people can really dig in.
I was thinking of this a while back, and being new to Go, I thought short one-on-one critique sessions with someone more experienced would be nice. It would also encourage newcomers to work on something in between meetups.
Ideas for things to do other than talks.