Skip to content

Instantly share code, notes, and snippets.

@mark
Created September 21, 2011 14:19
Show Gist options
  • Save mark/1232151 to your computer and use it in GitHub Desktop.
Save mark/1232151 to your computer and use it in GitHub Desktop.
Topic
- [ ] Code Katas
- [ ] Find all the unique sequences of digits, like [1, 1, 2, 3, 8] that have the following properties:
Each element of the sequence is a digit between 1 and 9
The digits add to 15
There is at least digit that appears exactly twice
No digit appears more than twice
Order is irrelevant [1, 1, 2, 3, 8] and [1, 3, 2, 1, 8] are the same sequence and only count once.
I believe the original problem did specify that there are 38 sequences that match.
- [ ] Bowling Scores
- [ ] codekata.pragprog.com <http://codekata.pragprog.com/>
- [ ] Some problems from projecteuler.net—index.php <http://projecteuler.net/index.php?section=problems&page=1>
- [ ] Prime Factorization
- [ ] How To Win 999
- [ ] codingdojo.org—wiki.pl <http://codingdojo.org/cgi-bin/wiki.pl?KataCatalogue>
- [ ] Solving problems without using conditionals
- [ ] String Calculator
- [ ] Markov Chains
- [ ] community.topcoder.com—tc <http://community.topcoder.com/tc> ?
- [ ] Magic Square?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment