From Otaku, Cedric’s weblog: Here is an interesting coding challenge: write a counter function that counts from 1 to max but only returns numbers whose digits don’t repeat. For example, part of the output would be: * 8, 9, 10, 12 (11 is not valid) * 98, 102, 103 (99, 100 and 101 are not [...]
-
Authors
-
Recent Posts
- Gradle, Lift, and Google App Engine
- Back Again to There: A Nontheistic Statement of Faithiness
- There and Back Again: A Journey Into and Out of Faith
- My Introduction to ScienceOnline (#scio12)
- OS-X: Using Tor for All HTTPS Connections
- Time for More Tor: How to Set It Up
- “Statically Typed Groovy”? Bwuh? I’m confused.
- My Experience Installing F# on OS-X
- Newly Minted: JavaCC/JJTree Plugin for Gradle
- Nuclear Rationality
All-Time Popular Posts
- 100% Let Me Save You $40: Here's How to Be Happy
- 77% Dear User of My Open Source Project
- 60% Postgres for the win!
- 57% 7 Actually Useful Things You Didn't Know Static Typing Could Do: An Introduction for the Dynamic Language Enthusiast
- 48% What good is a CS degree?
- 45% How Ocaml Can Be Improved
- 41% What is a functional programming language?
- 39% The problem with STM: your languages still suck
- 37% Problems with Hash Tables
- 35% A Monad Tutorial for Ocaml
