All Questions
5 questions
4votes
1answer
1kviews
Solving the Burst Balloon problem using Dynamic Programming
Continuing where I left off previously to solve the problem described here, I've now solved the same using dynamic programming (following Tikhon Jelvis blog on DP). To refresh, the challenge is to ...
- 255
4votes
1answer
170views
Naive implementation of Burst Balloon
As part of learning Haskell, I'm solving few problems, usually solved imperatively. I've come up with a naive solution for the problem described here, which is to find a sequence in which to burst a ...
- 255
3votes
1answer
173views
Programming Contest - Snuke Festival
Problem Statement The season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three ...
- 133
4votes
1answer
427views
Prim's Lazy Minimum Spanning Tree Algorithm in Haskell (Project Euler# 107)
I have implemented Lazy version of Prim's Minimum Spanning Tree Algorithm. I want to improve the code structure, follow prevalent conventions and reduce code size. I am solving Project Euler #107. ...
- 1,466
5votes
2answers
401views
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 ...
- 105
