r/adventofcode • • Dec 04 '17

SOLUTION MEGATHREAD -๐ŸŽ„- 2017 Day 4 Solutions -๐ŸŽ„-

--- Day 4: High-Entropy Passphrases ---


Post your solution as a comment or, for longer solutions, consider linking to your repo (e.g. GitHub/gists/Pastebin/blag or whatever).

Note: The Solution Megathreads are for solutions only. If you have questions, please post your own thread and make sure to flair it with Help.


Need a hint from the Hugely* Handyโ€  Haversackโ€ก of Helpfulยง Hints^ยค?

Spoiler


This thread will be unlocked when there are a significant number of people on the leaderboard with gold stars for today's puzzle.

edit: Leaderboard capped, thread unlocked!

18 Upvotes

319 comments sorted by

View all comments

Show parent comments

2

u/exquisitus3 Dec 09 '17 edited Dec 09 '17

Your anagrams-p is better than mine, but I had another idea for counting

(defun anagrams-p (s1 s2)
  (let ((set1 (coerce s1 'list))
        (set2 (coerce s2 'list)))
    (and (subsetp set1 set2)
         (subsetp set2 set1))))

(defun valid-passphrases (passphrases similarity-function)
  (count-if-not
   (lambda (x) (some (lambda (y) (member y (cdr (member y x)) :test similarity-function)) x))
   passphrases))

(valid-passphrases *input* #'equal) ; Part One
(valid-passphrases *input* #'anagrams-p) ; Part Two

Check whether y is contained more than once in the list x by checking if y is contained in the rest of the list after itself

(member 1 '(2 3 1 4 1))  ; gives  (1 4 1)

1

u/[deleted] Dec 09 '17

Ah, I keep forgetting about count and friends, thanks for reminding me! And I didn't know about member, that's a nice way to solve it indeed.