I'm not a student, and haven't touched scheme since first year university in
2006. I overheard the problem discussed and wanted to give it a shot.
Essentially wondering since I couldn't do it with all the constraints, whether
I'm lacking some fundamental understanding.
--
You received this mes
Thanks for all the help guys, it really helps with my understanding.
So it seems to me there's no real easy way to do this while keeping all the
restrictions intact.
I sat here thinking about it for quite a while before posting, as I thought I
missed some simple solution, as I'm inexperienced
Hi all,
Trying to learn a bit about recursion in racket.
The question is to remove duplicates from a list while maintaining the order of
the list.
one function to remove duplicates from the left,
i.e. 1 2 1 3 2 4 5 -> 1 2 3 4 5
and one from the right.
i.e. 1 2 1 3 2 4 5 -> 1 3 2 4 5
I've go
3 matches
Mail list logo