Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
Apropos Clojure - March 24, 2021

Show Notes

Topics

New destructuring

https://clojure.org/news/2021/03/18/apis-serving-people-and-programs

Reagent code looks the same after 8 years

https://www.youtube.com/watch?v=pd8kWJVDQD4

https://twitter.com/yogthos/status/1373270067736162305

How much can a Clojure developer do alone?

https://yyhh.org/blog/2021/03/how-much-can-a-clojure-developer-do-alone/

Notes

  • Use the REPL
  • Get a teacher
  • Clojure was design for small teams
  • Composable, readability, abstraction

Strange Loop conference

Sept 30 - Oct 2, 2021

https://thestrangeloop.com/

Grokking Simplicity has a cover!

Grokking Simplicity cover front and back

https://lispcast.com/gs

Learn ClojureScript by Andrew Meredith

Learn ClojureScript cover

https://www.learn-clojurescript.com/

REPL!!!!

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.

From PurelyFunctional.tv Newsletter 419

Where to join us

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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment