https://clojure.org/news/2021/04/06/state-of-clojure-2021
https://clojureverse.org/t/modern-js-with-cljs-class-and-template-literals/7450
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 aThanks to this site for the challenge idea where it is considered Hard in Python. The problem has been modified from the original.
From PurelyFunctional.tv Newsletter 419
Discord - Join if you want to watch us live or chat! https://discord.com/invite/hGNnK8N
Recording and playback on YouTube - https://www.youtube.com/channel/UC1UxEQuBvfLJgWR5tk_XIXA
Follow us on Twitter for updates - https://twitter.com/AproposClj