Tagged Questions
3
votes
1answer
69 views
Project Euler Problem 14 in Clojure
I recently began learning Clojure. In order to get better acquainted with it, I've been tackling Project Euler challenges.
Problem 14 is not really a difficult one. It asks for the number that ...
1
vote
1answer
44 views
Project Euler #20 solution in Clojure
Problem:
\$n!\$ means \$n × (n − 1) × ... × 3 × 2 × 1\$
For example, \$10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800\$, and the sum of the digits in the number \$10!\$ is \$3 + 6 + 2 + 8 + 8 + 0 + ...
3
votes
3answers
95 views
More succinct / ideal solution to Project Euler #22
"Using names.txt (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical ...
6
votes
3answers
341 views
Finding the sum of the digits appearing in the leaves via in-order traversal
The following text is an in-order traversal of a binary tree with 1023
nodes. What is the sum of the digits appearing in the leaves?
How can I improve this Clojure code? It looks strange to me ...
3
votes
2answers
319 views
Searching for repeated characters in a sequence of characters
The following code solves this problem:
The 3072 characters below contain a sequence of 5 characters which is
repeated. However, there is a twist: one of the sequences has a typo.
To be ...
15
votes
3answers
1k views
Project Euler Problem 2 in Clojure
I am in the process of learning Clojure. I am fairly new to functional programming and would like to know if my code smells or if there are any performance implications with my approach.
...
