Skip to content

Instantly share code, notes, and snippets.

What would you like to do?
Programming Praxis 19 Aug 2011 (first non-repeating char) solution in PLT Racket
#lang racket
(define (first-uniq chars)
(when (empty? chars)
(raise "There are no unique letters"))
(let ([c (first chars)])
(if (memq c (rest chars)) ; MEMQ is like MEMBER with EQ?
(first-uniq (remq* (list c) chars)) ; N.B the tail-recursion here
(require rackunit)
(check-equal? (first-uniq (string->list "aabcbcdeef"))
(check-equal? (first-uniq (string->list "faabcbcdeef"))
(check-equal? (first-uniq (string->list "aabcbcdeefd"))
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.