Tagged Questions
4
votes
1answer
75 views
Computation for finding the largest prime factor of 600851475143 is slow
I implemented the following for Project 3 in Project Euler:
...
5
votes
0answers
56 views
Project Euler Problem 18 (Haskell) - Maximum path sum I
I've implemented the solution to Project Euler Problem 18 in Haskell and I'd like to get some thoughts on my implementation. Its the dynamic programming solution, working from the bottom up.
...
4
votes
1answer
95 views
Dynamic programming with Project Euler #18
I just wanted to get an opinion on my dynamic-programming Haskell implementation of the solution to Project Euler problem 18.
The Problem:
By starting at the top of the triangle below and moving ...
11
votes
1answer
134 views
Finding the next higher digital permutation of a number
This is my solution for CodeEval challenge 44.
You are writing out a list of numbers.Your list contains all numbers with exactly Di digits in its decimal representation which are equal to i, for ...
5
votes
1answer
115 views
Project Euler #15 in haskell
I've solved Project Euler #15 in Haskell, but I feel like there might be a better way to express my solution that I'm not seeing. I start out defining my types:
...
4
votes
1answer
61 views
Project Euler Problem 1 - Multiples of 3 and 5
I wrote this function for Project Euler Problem 1.
...
4
votes
1answer
454 views
Project Euler #14 (Longest Collatz Sequence) in Haskell
You can check the problem here:
http://projecteuler.net/problem=14
My first approach in Haskell was this:
...
3
votes
2answers
425 views
Google Code Jam - Alien Language
I've successfully solved the Alien Languages problem for Google Code Jam in Haskell:
The algorithm is trivial - turn the patterns into regular expressions and see how many of the known words match ...
4
votes
2answers
220 views
Project Euler #9 in haskell
I am trying to teach myself haskell by means of project Euler
i sovled problem #9 by means of this code which is on the brute force side I was wondering if there is a more elegant/haskell/efficient ...
7
votes
4answers
625 views
Finding the sum of all the multiples of 3 or 5 below 1000, using list comprehension
I'm trying to compare my own implementation with another solution of Project Euler problem #1, which uses a list comprehension:
...
4
votes
3answers
304 views
BestApproximationDiv2 problem in Haskell
The task is to write a function findFraction maxDen number to find a short but good rational approximation to a decimal representation of a number — problem ...
