Saturday, July 12, 2014

1HaskellADay: Up, up, and away!

I've taken it upon myself to submit problems, then show the solutions, for @1HaskellADay. I started this work on July 1st, 2014. So the next set of entries serve to collect what I've done, both problems and solutions, and, if a particular day posed a particularly interesting problem, that I solved, or, that I didn't solve, I'll capture that here, too.

**Problems:**

###
**February 2017**

- February 27th, 2017: Gearing up to take on large sequences and subsequences for today's #haskell problem
- February 24th, 2017: Today's #haskell problem invites you to RULE THE GALAXY TOGETHER AS FATHER AND SON! with Binomial distributions. Darth Vader was right (then again, when is he ever wrong?) when he said: "Binomial distributions rock!" ... probably
- February 23rd, 2017: Today's #haskell problem is to find protein motifs (specifically Nglycos) in FASTA files. With UniProt files that do not redirect, we have today's #haskell solution to finding Nglycos motifs in FASTA files.
- February 22nd, 2017: Today's #haskell problem looks at improving fibonacci to be more correct and more memory efficient. Today's #haskell solution is where we fib down low on the nacci, yo.
- February 21st, 2017: For today's #haskell problem we look at BUNNEHZ! LOTS OF FIBONACCI BUNNEHZ! Oh, ... some of them die. It's very sad.
ERMIGOSH!

SO! MANY! BUNNEHZ!

for today's #haskell solution. - February 20th, 2017: length list is O(n) ... is there a better way than length? We look at that in today's #haskell problem. Usually you're doing something to a list other than length; today's #haskell solution uses that other information.
- February 17th, 2017: Today's #haskell problem looks at offspring of parents with multiple traits. My answer for today's #haskell problem includes crossing traits, and needs work on probabilities!
- February 16th, 2017: Today's #haskell exercise looks at genotypes and the possible outcomes of a genotype in offspring. Today's #haskell solution has fun with combinatorics and probability distributions to compute genotypes in offspring
- February 15th, 2017: Today's #haskell exercise examines what it is for a probability distribution to be an applicative functor. Distributing functions over values (probabilistically) gets us today's #haskell solution.
- February 14th, 2017: Oh, and from all of us at @1HaskellADay to all our dear fans: KAWWWWAAAAAAIIIIIII!!! Happy St. Valentine's Day!
- February 14th, 2017: Today's #haskell problem looks at probability distributions. Today's #haskell solution shows how to condense probability distributions for Ord keys.
- February 13th, 2017: We look for the majority element in small lists, then in large lists for today's #haskell problem. As of now, only 953 IN THE WORLD have solved this #rosalind problem. Are you going to be one of the elite 1,000 to have solved it? Today's #haskell solution traverses only some of the list to find the majority element.
- February 10th, 2017: Today's #haskell problem is about "binary search," according to rosalind.info; but I think this is easy. Using Data.Map.Map today's #haskell solution finds the indices in binary-search time!
- February 9th, 2017: For today's #haskell problem, we look at fibonacci numbers, ... then we go large. Today's #haskell solution is a little bit of fibo-nacci-ness ... and more than just a little bit!
- February 8th, 2017: Today's #haskell problem looks at a population by genotype to compute expected offspring via rosalind.info. We find out that there are a LOT of bunnies out there with dominant genotypes for today's #haskell solution.
- February 7th, 2017: Today's #haskell exercise looks at sets from sets using set-operators... not that I'm a Set theorist, or anything...
*update:*I've added a bonus to today's #haskell exercise: read in a pair of gzipped sets from rosalind.info and write out the answer to file. Today's #haskell solution uses Data.Set operators and a bit of category theory. Answer is a set of very big sets! - February 6th, 2017: Today's #haskell problem we return to rosalind.info to look at number of subsets of sets and applications. Sections rule the day for today's #haskell solution to subsets of sets
- February 3rd, 2017: Today's #haskell problem shows us that LOVE is a ROSE, but you better not PINK it ... wait: PICK it. Yeah. #pinkrose Today's #haskell solution taught me the word 'pone' and what that word means. Huh. 'pone.' Whatevs.
- February 1st, 2017: Today's #haskell problem gets distances between the Earth and Mars. Also, we'll plot orbits as a bonus. Today's #haskell solution computes distances using planetary #ephemeris data.

**Archive**

- 2017: Jan
- 2016: Dec Nov Oct Sep Aug Jul Jun May Apr Mar Feb Jan
- 2015: Dec Nov Oct Sep Aug Jul Jun May Apr Mar Feb Jan
- 2014: Dec Nov Oct Sep Aug Jul

Problems and solutions prior to July, 2014 posted on github at https://github.com/1HaskellADay/1HAD/

Problems starting from June 2016, along with new supporting Control and Data modules, are on new github repo at https://github.com/geophf/1HaskellADay/tree/master/exercises/HAD

Problems starting from June 2016, along with new supporting Control and Data modules, are on new github repo at https://github.com/geophf/1HaskellADay/tree/master/exercises/HAD

## 2 comments:

"Clone in IDE" just takes me to FP Complete's 404 page. Is there still a free IDE for working Haskell A Day problems? What? Where?

Thanks.

@RickFleischer Reposted to @1HaskellADay.

My answer: I use vi, simply inserting the copied text into the editor and working on the code off-line.

Post a Comment