New answers tagged

2

From the problem statement: Implement a function pingpong that returns the nth element of the ping-pong sequence without using any assignment statements. You may use the function num_sevens, which you defined in the previous question. Use recursion - the tests will fail if you use any assignment statements. Hint: If you're stuck, first try implementing ...


3

Code should be correct, maintainable, robust, reasonably efficient, and, most importantly, readable. To be certain that the code is correct, carefully read the specification and related documents. Forsyth–Edwards Notation PGN-SPEC Portable Game Notation Algebraic notation (chess) Chess For a code review, compare the specification and the code implementing ...


3

I tried to solve the Problem Euler 67 with Go, because I started to study Go recently. What could be a better approach? Could I use goroutines to increase performance? Code should be correct, maintainable, robust, reasonably efficient, and, most importantly, readable. I'm going to skip a full code review and narrowly focus my code review on the use of ...


Top 50 recent answers are included