Scheme Programming (R5RS) or Dialect of LISP // Functional Programming

can be done in DrRacket.

;;; Function remove: item list -> list

;;; Removes all occurrences of the item from the given list

For example:

>(remove 4 '(3 4 5 6 4 1) -> (3 5 6 1)

>(remove 8 '(3 4 5 6 4 1) -> (3 4 5 6 4 1)

What I got so far is wrong:

(define (remove n seq) (if (null? seq) seq) (if (eqv? n (car seq)) (remove n(cdr seq)) (cons (car seq)(remove n (cdr seq)))))