String difference
You are given two strings, a
and b
. We consider each letter to be unique, meaning duplicates are significant. Write a function that returns the count of letters in b
which do not occur in a
.
Examples
(strdiff "abc" "") ;=> {} ;; no characters in b don't occur in a
(strdiff "abc" "abc") ;=> {} ;; ditto
(strdiff "" "abc") ;=> {\a 1 \b 1 \c 1}
(strdiff "axx" "abcc") ;=> {\b 1 \c 2}
(strdiff "xxxx" "xxxxxx") ;=> {\a 2} ;; two x's in b that don't occur in a
Thanks to this site for the challenge idea where it is considered Hard in Python. The problem has been modified from the original.
Please submit your solutions as comments on this gist.
To subscribe: https://purelyfunctional.tv/newsletter/
@jaihindhreddy might worth mentioning that you have to remove negatives as well (not just zeros) or characters that have more occurrences in
a
thanb
will end up in the final map. Ex.