pairs = splitIntoLines(input).map(line => line.split(',').map(parseRange).map(rangeToFlags))
pairsWithFullyContainedRanges = pairs.filter(pairwiseEither(isSuperset)).length
getPairs = R.pipe(
splitIntoLines,
R.map(R.pipe(
R.split(','),
R.map(R.pipe(
parseRange,
rangeToFlags
))
))
)
isOneContainedInTheOther = R.pipe(
pair => [pair, R.reverse(pair)],
R.map(R.apply(isSubset)),
R.apply(R.or),
)
solvePart1 = R.pipe(
getPairs,
R.map(isOneContainedInTheOther),
R.count(R.identity),
)
solvePart1(input)
overlappingPairs = pairs.filter(([first, second]) => first & second).length
solvePart2 = R.pipe(
getPairs,
R.map(([first, second]) => first & second),
R.count(R.identity),
)
solvePart2(input)
pairwiseEither = R.curry((f, [a, b]) => f(a, b) || f(b, a))
isSuperset = (a, b) => a === (a | b)
isSubset = (a, b) => a === (a & b)
parseRange = (s) => s.split('-').map(Number)
/**
* Convert a one-based numeric range (both ends inclusive) into a corresponding bitmask, setting all bits whose index is included in the range
* e.g., the range [2, 4] is represented as 0b1110 (first bit unset, bits 2 through 4 set), while the range [5, 6] would be represented as 0b110000 (bits 1 through 4 unset, bits 5 and 6 set)
*/
rangeToFlags = ([a, b]) => {
return BigInt(`0b${'1'.repeat(b - a + 1)}${'0'.repeat(a)}`)
}
import {R, splitIntoLines} from '@senritsu/advent-of-code-2022-day-3'
import {adventOfCodeHeader, renderInput} from '@senritsu/advent-of-code-2022'
Purpose-built for displays of data
Observable is your go-to platform for exploring data and creating expressive data visualizations. Use reactive JavaScript notebooks for prototyping and a collaborative canvas for visual data exploration and dashboard creation.
