Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
325 views

Advent of Code 2016 Day 1 "No Time for a Taxicab"

I already solved it in JavaScript, where I'm more comfortable. I pretty much ported the algorithm from there. I wanted to try the first Advent of Code puzzle in a new language and I picked Racket. ...
joews's user avatar
  • 133
4 votes
1 answer
125 views

Introduce bindings for macro user

I'm doing the Racket track on exercism.io and solved the grains exercise: Write a program that calculates the number of grains of wheat on a chessboard given that the number on each square doubles. (...
user avatar
1 vote
2 answers
857 views

Project Euler #12 in Racket

Problem here. It's not exactly the brute force approach but I'm not using any sort of pre-calculated primes table, and I'm definitely not using the coprimality trick shown in the PE pdf. I'm finding ...
user avatar
3 votes
2 answers
308 views

Solution to Project Euler #1 - multiples of 3 and 5

I have been programming for about ~2 years, and mostly wrote OOP and structural code. Recently, I have decided to pick up a functional programming language, and Haskell being too alien for me, looked ...
DTSCode's user avatar
  • 193
6 votes
4 answers
725 views

Project Euler 1 (sum of multiples of 3 or 5 under 1000)

I solved this a while ago. In the moment I solved it I was learning Scheme and, well, I still am. I'm not looking at the best solution (I searched for it and coded it already, in Python), what I want ...
ArthurChamz's user avatar