In my first year working at Woovit as a back-end developer, I had a hard time. We had MySQL, ElasticSearch and DynamoDB. This stack came up during a growing stage of the company, but now there were...

Differently from last posts this problem cannot be solved with an obvious sql expression. To start, we will cover a useful data ingestion technique and then we are going deep into window functions ...

Problem 10 This problem asks for the sum of all prime numbers below two million. This is another problem that can be expressed with elegance in SQL. Since we already have the prime numbers up to 2 ...

Problem 7 This problem asks for 10001st number prime. As far as I know, there is no trick to get there. We need compute all the numbers in the series. As I’ve written before, solving Euler project ...

Generating prime factors is a task that comes often in the first 100 problems of Euler Project. One of the nice things of coding Euler project on top of postgres is that one can easily persist usef...

This is the first post of a series about using SQL, and postgres of course, to solve Project Euler problems. This started as an exercise to master advanced features of postgres/SQL. When I realized...