Much of the piece is devoted to building a term-rewriting system, even before getting to the meaty work of constructing the appropriate macros so that Clojure accepts the input C expression in a form which Clojure can manipulate. The reason this approach was so worthy of inclusion in the “Technical Interview” series is because Clojure is manifestly unsuited to approaching the problem in this way. In Kyle Kingsbury’s excellent Rewriting the Technical Interview, our protagonist solves FizzBuzz in Clojure by copy-pasting a solution written in C, and then building a term-rewriting system in Clojure to evaluate the C code directly. I promise that it will be worth your time. Don’t read further until you’ve read from at least “ Reversing the Technical Interview” through to the fourth interview, “Rewriting the Technical Interview”.

Mandatory prerequisite reading for this post: Kyle Kingsbury’s “Technical Interview” series. Patrick Stevens is a Developer at G-Research. Rewriting the Technical Interview, in Mathematica

For loop mathematica