2d:null 2e:["$","title",null,{"children":"Day 4, Advent of Code 2019 | Andreas Plesch | Observable"}] 33:[] 31:{"id":"fc79190c44d76567","slug":"day-4-advent-of-code-2019","title":"Day 4, Advent of Code 2019","thumbnail":"e97b2ab9cbcfa27cf70a176584c50b4bcdb934f6943ba4083c176106a355695e","access_level":"public","create_time":"$D2019-12-04T14:30:13.201Z","update_time":"$D2019-12-04T15:25:14.021Z","view_time":null,"first_public_time":"$D2019-12-04T15:05:59.457Z","has_unpublished_edits":null,"fork":{"id":"2bab2a84decb46ae","slug":"day-3-advent-of-code-2019","title":"Day 3, Advent of Code 2019","owner":{"id":"3a7167e5e638bcd0","login":"andreasplesch","name":"Andreas Plesch"}},"stars":1,"starred":false,"owner":{"type":"team","id":"3a7167e5e638bcd0","login":"andreasplesch","name":"Andreas Plesch","avatar_url":"https://avatars-next.observableusercontent.com/4da1ba746a4b25e755d1c9b71ca1c72165a9c40e02aee1f3fcae880584d70c9c","tier":"starter_2024"},"version":363,"publish_version":363,"role":null,"authored":false,"authors":[{"type":"individual","id":"171053d51d09c7fc","login":"andreasplesch","name":"Andreas Plesch","avatar_url":"https://avatars-next.observableusercontent.com/4da1ba746a4b25e755d1c9b71ca1c72165a9c40e02aee1f3fcae880584d70c9c","tier":null}],"members":[{"type":"individual","id":"171053d51d09c7fc","login":"andreasplesch","name":"Andreas Plesch","avatar_url":"https://avatars-next.observableusercontent.com/4da1ba746a4b25e755d1c9b71ca1c72165a9c40e02aee1f3fcae880584d70c9c","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":1,"collection":{"id":"9b46032982715a60","slug":"aoc2019","title":"aoc2019","owner":{"id":"3a7167e5e638bcd0","login":"andreasplesch","name":"Andreas Plesch"}},"type":"notebook","body":{"title":"Day 4, Advent of Code 2019","cells":[{"id":0,"value":"md`# Day 4, Advent of Code 2019\n\nhttps://adventofcode.com/2019\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":4,"value":"md`\n

\nYou arrive at the Venus fuel depot only to discover it's protected by a password. The Elves had written the password on a sticky note, but someone threw it out.\n\nHowever, they do remember a few key facts about the password:\n\n- It is a six-digit number.\n\n- The value is within the range given in your puzzle input.\n\n- Two adjacent digits are the same (like 22 in 122345).\n\n- Going from left to right, the digits never decrease; they only ever increase or stay the same (like 111123 or 135679).\n\nOther than the range rule, the following are true:\n\n111111 meets these criteria (double 11, never decreases).\n223450 does not meet these criteria (decreasing pair of digits 50).\n123789 does not meet these criteria (no double).\n\nHow many different passwords within the range given in your puzzle input meet these criteria?\n\nYour puzzle input is 193651-649729.\n

\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":11,"value":"puzzleInput = `193651-649729`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":122,"value":"range = puzzleInput.split('-').map(Number)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":104,"value":"part1 = answer(range)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":15,"value":"answer = function (range) {\n let a,b,c,d,e,f,pwd,N ;\n let pwds = [];\n for (a=0; a<10; a++) {\n for (b=a; b<10; b++) {\n for (c=b; c<10; c++) {\n for (d=c; d<10; d++) {\n for (e=d; e<10; e++) {\n for (f=e; f<10; f++) {\n pwd = [a,b,c,d,e,f];\n if (!pwd.some( (d,i,a) => d == a[i+1] )) continue\n N = Number(pwd.join(''));\n if (N < range[0]) continue\n if (N > range[1]) continue\n pwds.push(pwd);\n }\n }\n }\n }\n }\n }\n return {n: pwds.length, pwds: pwds};\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":23,"value":"md`

\n-- Part two --\n\nAn Elf just remembered one more important detail: the two adjacent matching digits are not part of a larger group of matching digits.\n\nGiven this additional criterion, but still ignoring the range rule, the following are now true:\n\n112233 meets these criteria because the digits never decrease and all repeated digits are exactly two digits long.\n\n123444 no longer meets the criteria (the repeated 44 is part of a larger group of 444).\n\n111122 meets the criteria (even though 1 is repeated more than twice, it still contains a double 22).\n\nHow many different passwords within the range given in your puzzle input meet all of the criteria?\n

`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":324,"value":"part2 = {\n return part1.pwds.filter(\n pwd => pwd.some (\n (d,i,a) => d == a[i+1] && d != a[i+2] && d != a[i-1]\n )\n );\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W33","stdlib":"1","titling":"auto"}} 32:"$31:body"