Project Euler
101–110 of 142 posts
Re: Project Euler
#102Since this is still on HN frontpage. Does anyone suggest any math books to help solve these problems. I am pretty sure you can't solve problems above 50 without strong maths background.
Re: Project Euler
#103Re: Project Euler
#104So much more fun than leetcode. OTOH, unlikely to help you in an interview.
Re: Project Euler
#105I decided to apply for a junior developer job. I got an interview and to prepare for an interview I found this site, Project Euler. I did ten or so tasks.
The interview started out pretty bad, they asked me some technical questions which I did not give good answers to, and I saw that they where not impressed. Then they wanted me to solve two programming problems on a white board. Imagine the relief I felt when both of these questions where from the ones that I solved on Project Euler a couple of days before! I nailed them and the interviewers where clearly impressed. In the end they hired me and motivated it with that although I lack a lot of theory I am obviously a very good coder haha.
Anyway, that was what I needed, when I got this job I quit the drugs and got my act together. 12 years later I live a confortable life as a freelancer and have even managed to build my own SaaS with paying customers! Thank you Project Euler.
Re: Project Euler
#106I solved a few using AWK, fun: https://github.com/ketancmaheshwari/projecteuler
Re: Project Euler
#107Glanced at the exercises. It appears that two of them have numbers arranged in a triangle and ask for a longest path. Hmm. Given such a triangle, let m be the largest number in the triangle. For each x in the triangle, replace it with m - x. For the resulting triangle, solve it to give the shortest path using one of the well known network shortest path algorithms.
Re: Project Euler
#108Ha! I did a lot of these around 2007-2008. I solved the first 100 or so ones. Solving these were more fun than any other programming problems site I've seen. I quit it when I realized I was spending 4+ hours per problem - I couldn't justify the time. Beyond a certain point, most required some knowledge of elementary number theory.
Re: Project Euler
#109Like many others here, Project Euler was foundational in my education and growth as a programmer. Leonhard Euler himself is an incredible figure and arguably the most prodigious contributor to mathematics throughout history. So much so that people started naming things discovered by him after the next person to have proved them. https://en.wikipedia.org/wiki/List_of_topics_named_after_Leo...
Re: Project Euler
#110> A number is a perfect square, or a square number, if it is the square of a positive integer. For example, is a square number because ; it is also an odd square. The first 5 square numbers are: , and the sum of the odd squares is . Among the first 881 thousand square numbers, what is the sum of all the odd squares?
I wanted to use Uiua, and hence:
/+ⁿ2+1⍜÷⇡ 2 881000
But Uiua doesn’t support big ints, just f64. So yuck, python to get an accurate answer. Just sad now.