advent-of-code-jq

Solving Advent of Code with jq

3Distinct people

4Mentions

0Explicit recommenders

223GitHub stars

REPOSITORY AT A GLANCE

What to know before exploring

Solving Advent of Code with jq

GitHub

No documented product use has been verified yet.

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

No other repository is repeatedly linked in the same discussions.

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 5:04:57 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

HN mentions by week4 dated mentions

Observed mentions: 2022-12-13 01:29:54 UTC to 2023-02-04 19:29:49 UTC. Weeks start Monday, UTC.

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges

UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
Period	Start (UTC)	End (exclusive, UTC)	Mentions	Submissions	Comments
Dec 12	2022-12-12 00:00:00 UTC	2022-12-19 00:00:00 UTC	3	1	2
Dec 19	2022-12-19 00:00:00 UTC	2022-12-26 00:00:00 UTC	0	0	0
Dec 26	2022-12-26 00:00:00 UTC	2023-01-02 00:00:00 UTC	0	0	0
Jan 2	2023-01-02 00:00:00 UTC	2023-01-09 00:00:00 UTC	0	0	0
Jan 9	2023-01-09 00:00:00 UTC	2023-01-16 00:00:00 UTC	0	0	0
Jan 16	2023-01-16 00:00:00 UTC	2023-01-23 00:00:00 UTC	0	0	0
Jan 23	2023-01-23 00:00:00 UTC	2023-01-30 00:00:00 UTC	0	0	0
Jan 30	2023-01-30 00:00:00 UTC	2023-02-06 00:00:00 UTC	1	0	1

4 sources

A nice little Makefile driving each day too: https://github.com/odnoletkov/advent-of-code-jq/blob/master/... And I somehow just learned about asciicinema from it: https://asciinema.org This is parsing a maze into a graph and finding the shortest path: https://github.com/odnoletkov/advent-of-code-jq/blob/master/... I can kinda make out how it's parsing the input and converting it to a graph. I can't make heads or tails of the path finding and I don't see anything that really looks like Djikstra's algorithm.