Hacker News new | past | comments | ask | show | jobs | submit login
Ninety-Nine Lisp Problems (ic.unicamp.br)
25 points by parenthesis on July 18, 2008 | hide | past | favorite | 10 comments



But a malloc ain't one.


List me!


I looked at the first solution and my reaction is something along the lines of "what????".

Why not just something simple like.. (defun foo(thing) (list (nth (1- (length thing)) thing))

Same applies for problem 2.


And for number #5 you don't even need to write a function. Why not just use reverse? And notice his indentation and closing of parens is all wrong (i.e. not Lisp style). He's writing Lisp code thinking in a another language[1].

It's still a good exercise to go through them all as a Lisp newb like myself when I'm bored or need a break.

[1] Programming language, not Portuguese. :)


Well using reverse sort of misses the point. You are supposed to implement reverse.


I just find it a bit interesting that you are supposed to implement things that are given. That sort of defeats the purpose of doing one for a specific language.


Ah, well that does make it a bit more interesting. :)


I think you don't really want to use length. Since it is a program evaluating last it might not be that bad as you have to goto the last element anyway.

Here is mine:

(defun our-last (list) (if (rest list) (our-last (rest list)) list))


Or even (defun last(thing) (car (reverse thing)))


Given the context(first two problems), what is a 'box'?




Consider applying for YC's first-ever Fall batch! Applications are open till Aug 27.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: