#advent-of-code

1 messages · Page 4 of 1

earnest forge
hollow wharf
#

i still remember several times where my program ran as expected on first try itself. good memories

ivory venture
#

Is day 5 as straightforward as it looks? Is there a crazy mathy solution?

tepid cairn
#

no you need to solve the halting problem

lusty rover
#

Don't know about maths because I can't maths because I'm a dog

ivory venture
#

Hmm last year there were a lot of opportunities to use numpy, this year has been a bit meh so far 😔

low condor
#

I feel like it's been easier this year so far compared to previous years

lusty rover
#

I've actually been able to understand everything in a reasonable amount of time
So... I agree

hidden musk
low condor
#

Even the part 2's seem to be on the same difficulty as part 1

#

which is not often the case for historical part 2s

hollow wharf
#

Day 5's only challenge was parsing, lots of people just edited the input to parse it more easily

lusty rover
past comet
#

gaps :/ hrmmm

#

oooh!

past comet
hollow wharf
#

It is, though for being faster people edited it, as said

#

Less thinking, faster parsing

ivory venture
#

Put in spoilers any details please!

cyan sleet
#

tbf, if I were going for speed I would have reformatted to make the reading of crates trivial

hidden musk
#

well if you're gonna do that, just hand parse it as a static or const

past comet
#

woo, got it

#

oh no, the cratemover is over 9000

#

I am very pleased though, I only need to edit my crane_operation function to get part 2

lusty rover
minor ivy
#

Hey guy

#

s

#

Is the goal of the Day 5 aoc is to make the crates say CMZ?

#

Like all 3 sections

#

Should it say CMZ at the bottom?

#

with the 3 crates

#

im just trying to clarify and see if I'm reading it correctly

green coral
#

you need to return the top crate of each pile in order after the crane operations

lusty rover
#

Terrible?

hollow wharf
#

You can see them shown in bold here, that is the result for the testing data

minor cave
dense osprey
#

should i read the amount of piles from the file or is it ok just creating a dict with 9 stacks(bcs the input file has 9stacks only)

dense osprey
#

or is this already cheating

hollow wharf
#

There's no cheating

#

The goal is to get at the result

#

The path you choose doesn't matter

odd wigeon
#

put the prompt into GPT to generate code for you.

hollow wharf
#

Yeah that's just being pathetic KEKW

lusty rover
tepid cairn
#

I think gpt managed yesterday

#

But failed on day 2

lusty rover
#

It just gave me a working answer for day 1

#

But it missed the blank lines

mossy elm
#

hi can someone html ?

#

i need advice how target in div only text

minor cave
limber aurora
#

if i where to only learn one module for AoC what should i learn

#

itertools? or maybe re?

#

(ive seen those two used a lot)

#

collections seems to also be a common one

placid lake
#

regex is super useful for input parsing for a lot of days

#

itertools and more_itertools are also great

#

there's honestly a lot of packages you could use for AoC

#

the ones i use a lot are re, itertools, collections, more_itertools, numpy, networkx, scipy, sympy

#

from most to least approximately

mossy basin
#

numpy solutions are my favorite

unique osprey
#

yeah

#

Saved me a lot of time last year for sure

placid lake
#

numpy is very fun

limber aurora
#

any specfic things i need to learn

#

or should i just google "numpy full guide" or something on youtube and try using the stuff

unique osprey
#

Yeah you mostly need to be familiar with the concept of working with the data as a group per axis or whole matrix or whatever

#

Basically doing operations on everything at once rather than looping over something

unique osprey
placid lake
#

also is it just me or is this year much easier than last year so far

limber aurora
#

do you not need to define an array as a numpy array to use numpy

unique osprey
#

definitely easier this year

limber aurora
placid lake
#

yeah i agree

unique osprey
#

My day 4 last year heavily used numpy 😄

placid lake
#

saaame

#

and day 2

limber aurora
#

which day last year was the exponentially growing fish

unique osprey
#

IDK what the hell this did but here

placid lake
#

the snailfish?

#

that was horrible lmao

low condor
#

lanternfish, right?

limber aurora
#

yes

placid lake
#

oh snailfish was 2020 maybe

low condor
limber aurora
#

thinking of the optimization for part 2 was quite cool but it did take me some thinking

low condor
#

ditto

placid lake
#

ooh yeah i remember that

low condor
#

just looking back on my solution on that

#

that was a fun puzzle

limber aurora
mossy basin
#

which was snailfish

low condor
#

just looking at this

[1,2]
[[1,2],3]
[9,[8,7]]
[[1,9],[8,5]]
[[[[1,2],[3,4]],[[5,6],[7,8]]],9]
[[[9,[3,8]],[[0,9],6]],[[[3,7],[4,9]],3]]
[[[[1,3],[5,3]],[[1,3],[8,7]]],[[[4,9],[6,9]],[[8,2],[7,3]]]]

gives me PTSD

unique osprey
mossy basin
low condor
#

I felt like I came up with a great solution to it though, so it was also satisfying

unique osprey
low condor
#

How I solved it is that I ||flattened the structure||

mossy basin
#

i just had a bunch of recursive methods, they were all pretty simple though

peak dock
low condor
#

Turned it into || a flat list of two-item elements, one element for the value, one for its "level" in the hierarchy||

#

Made explosions way easier

mossy basin
#

i did use eval for the parse:
||SNAIL_NUMS = [nodify(*literal_eval(line)) for line in aoc_helper.day(18).splitlines()]||

low condor
#

definitely the easiest way to parse for sure

placid lake
#

i made a class too lol

unique osprey
halcyon pulsar
#

I've made some mistake somewhere in part 2 and i cant figure out where

#

this is bloody annoying

unique osprey
mossy basin
#

guy i pay to get my inputs

normal umbra
#

lol

mossy basin
#

!pypi aoc-lube

marsh currentBOT
mossy basin
#

it's this, but an older version

normal umbra
#

ooh

#

so does everyone use it? I still seem to be doing things the old fashioned way

mossy basin
#

no, not everyone uses a fetcher

unique osprey
#

Although i may build my own input fetcher

#

...i probably should

normal umbra
#

I see

#

I think I'll stick to my method for now

unique osprey
#

I built my own little framework for executing the problems, timing, parsing, etc

normal umbra
#

ooh nice

halcyon pulsar
#

This is so odd, when I run this snippet py for _ in range(move): crates[from_].pop() within my instructions loop it replaces every single item in the stack with a P?? I've never seen anything so whack, but when I comment these lines it doesnt do this. Does pop do something I don't know?

mossy basin
normal umbra
#

pop just removes the last element in the list

halcyon pulsar
halcyon pulsar
mossy basin
#

because thats n references to the same list

#

you need [[] for _ in range(n)]

#

to make n separate lists

halcyon pulsar
#

i did this ```py
crates = [[], [], [], [], [], [], [], [], [], ]

#

are these not seperate

mossy basin
#

those are separate

halcyon pulsar
#

fixed my mistake, i was indexing from the start instead of the end - still kinda dont understand the pop but ill move on

royal lantern
#

Question: do empty sets/lists count as "falsy?"

rapid wolf
#

yup

royal lantern
#

ty

pine ravine
#

Day 5 is so hard 😭

low condor
pine ravine
#

I don’t need hints yet

#

It’s just that every part of this challenge is a… challenge

#

I only now finished processing and transposing the crate matrix

#

And moving the crates is easier said then done

next viper
#

That was the hardest part imo, parsing the initial crate stacks 🤣

pine ravine
#

Why did I not make it upside down?

#

That would make this a lot easier

#

Ok yeah let’s do that

hollow wharf
#

gosh i am writing a list comprehension in a list comprehension in a list comprehension in a list comprehension
i am confused because i need one last list comprehension which idk how to write

low condor
#

why not write it in for loop style first?

#

once that's done you can always convert it to list element afterwards

#

sometimes that can be easier if you don't have a perfect idea in your head of how the list comp looks

hollow wharf
#

ok i'll try that if this doesn't work

#

thanks for the tips

next viper
#

Yeah I always start with a regular for loop unless the comprehension is trivial (and even then I end up switching it back half the time anyways for debugging)

hollow wharf
#

How does the number of participants 900?
I thought the maximum number is 200

hollow wharf
#

Thank you

tidal mist
ripe meteor
low condor
#

People love code golf

cyan sleet
#

when the problems are simple people find ways to entertain themselves 😛

vital field
#

omg i completely forgot about advent of code

#

am i still able to sign up?

sharp panther
#

yes!

vital field
#

oh awesome

sharp panther
#

there's no signing up to it, you can just do problems whenever

vital field
#

oh okie

sharp panther
#

you can even do problems from 7 years ago

vital field
#

oo

#

where do i see the challenges?

sharp panther
vital field
#

ah oke

hollow wharf
# tidal mist you mean `[[]] * n`

be carefull this is so dangerous syntax it actually creates 3 list object which refers one another if you change value of one of them then changes the value each

low condor
#

If you follow that chain of conversation backwards you’ll see it started from someone having that exact problem

hollow wharf
#

😉

#

once i had a big headache because of this syntax

low condor
#

It is definitely one of the Python “gotchas”

#

How mutable objs behave

hollow wharf
tidal mist
#

zip(*n*[iter(stuff)])

hollow wharf
tidal mist
#

i think that's useful

#

n*[iter(stuff)] creates a list of n times the same iterator.

#

hm

#

no i got it wrong

#

now i fixed it.

hollow wharf
#

list( n * [ * iter(stuff)]) it should be like this maybe

#

asteriks should be in list because iter only a object

tidal mist
#

for example
list(zip(*3*[iter([1, 2, 3, 4, 5, 6])]))
returns
[(1, 2, 3), (4, 5, 6)]

hollow wharf
#

but list(*stuff) is wrong

tidal mist
#

yes, you're right. accidentally i wrote list when i meant zip

hollow wharf
#

because list only takes 1 argument

hollow wharf
#

do you know Terry A.?

#

i remembered his quote when see this syntax "an idiot admires complexity but a genius admires simplicity"

tidal mist
hollow wharf
#

he is holy c and temple os creator as he said he is the best programmer in the world R.I.P

tidal mist
#

would this be less complex?
[stuff[i:i+n] for i in range(0, len(stuff), n)]

royal lantern
#
if not set(rge1) - set(rge2):```
#

this conditional will return true if the set has any values inside, right?

hollow wharf
#

hey im having a problem with this code ```from Airport import *
from Flight import *

allAirports = []
allFlights = {}

def loadData(airportFile, flightFile):
with open(airportFile, 'r') as file:
for line in file:
line = Airport()
print(line) ```

#

the task is supposed to read airport file and put each line into an airport object using aiport class

tidal mist
royal lantern
tidal mist
#

so if rge1 has anything that rge2 doesn't have.

royal lantern
tidal mist
#

yes

#

so if rge2 has everything that rge1 has.

low condor
long egret
#

i haven't started yet, but this one will require some string manipulation to get everything into a format we want, yes?

low condor
long egret
#

ah

#

i suppose one could do that

woven sable
long egret
#

yeah im doing that

#

too lazy to parse it

woven sable
#

i wish the input was a lot longer for today

long egret
#

seems like parsing is half the fun today

woven sable
#

no.

#

it's not fun

#

the actual solutoin is fun tho

long egret
#

figuratively of course

woven sable
#

i used match/case i was happy

long egret
#

the actual solution is relatively easy

woven sable
#

i found an actual usecase for it

wispy glacier
tepid cairn
#

I used match/case for day 2!

#

or whichever day had rps

urban locust
#

I'm still figuring out how to parse todays input

tepid cairn
#

aoc is probably a good chance to learn numpy

urban locust
#

Would numpy help parse the input?

tepid cairn
#

for today's? You might be able to do something with it, but I imagine it'd be helpful later down the line as well

urban locust
#

I suppose I'm spending the next hour learning numpy then

#

Seems like a library that is worth learning either way

tidal mist
#

I'd imagine numpy not being very helpful today.

royal lantern
#

that they used today

#

I'm going to check that out

woven sable
#

||only to transpose the input||

low condor
sharp panther
#

day 5: ||i was far too lazy to parse. i wrote a fairly simple solution after, but my actual answer didn't use it for speed.||

urban locust
#

||One of my ideas was to transpose the input as well so numpy might be useful but I'll also look at this "match/case"||

tidal mist
tepid cairn
#

day 5: ||yeah, I managed to parse the input fairly easily without bringing in numpy||

fierce granite
#

day 5: ||. .||

hollow wharf
#

15 mins

modern harness
#

Are submission timers problem specific? If I'm struggling with a completely different problem when the new problem is posted, could a bad answer submitted at 11 of an old problem cause me to have to wait to submit the current problem?

torn thorn
#

wym?

#

oh you mean that

earnest forge
naive stone
#

&aoc c

shut trellisBOT
#

Day 6 starts <t:1670302800:R>.

torn thorn
#

whooo

hidden musk
#

👀

woven sable
#

10 sec!

shut trellisBOT
arctic gust
#

;-;

#

I hate school

pine tiger
#

OMG OMG OMG

earnest forge
#

Wow

minor cave
torn thorn
#

i got so confused

#

by what it meant by "message"

arctic gust
hidden musk
#

off by one lol

naive stone
#

i should've done that way quicker

earnest forge
naive stone
#

i assumed this one would be difficult but i found this easier than day 1

#

3 lines of code

#

:/

pine tiger
#

yeah lol

#

||len(set(s[i:i+4]))==4||

naive stone
#

yep ._.

covert arrow
#

Had to resubmit twice because I was off by 4 the first time but I thought it was off by one

earnest forge
#

Should probably add something to the submitter that at least joins iterables lol

covert arrow
#

How are you getting a tuple output though?

#

Isnt the answer just a number?

earnest forge
covert arrow
#

Ah I see

#

I am having a "advent of realizing I can't read" moment every day now

stable shale
#

I misread the puzzle and ||submitted the starting index instead of the ending|| reee

torn thorn
#

rip

#

i think a lot of ppl did that

sharp panther
torn thorn
stable shale
#

The tests failed, so I didn't get timed out, but it took me a fat while to figure out what went wrong

night berry
#

Me still faster than ChrisJL :V

torn thorn
#

whose that

night berry
#

Server staff

torn thorn
#

nice

night berry
#

I'm setting my goal of ranking higher than ChrisJL this AoC.

sharp panther
torn thorn
unique osprey
stable shale
#

Yeah, I did. Just took me a while to figure out why it was failing with the sample

polar sand
#

Frustrated with myself. Wanted to do this one the moment it releases and fell asleep again until 30 minutes past release time ╚(•⌂•)╝

#

And then it's one easy enough that I could have done it even if I was in front of my PC barely awake xD

cunning scarab
#

We need more puzzles like this I can make them on the bus on my way to school now

#

Online phone ide aint half bad

drowsy sleet
#

anyone else feeling like todays puzzle was too easy compared to the others?

mossy python
#

Todays was the easiest one yet imo

drowsy sleet
#

I found todays easier

mossy python
vital schooner
#

Why is the leaderboard bugged?

#

Some of the players got all stars on all AoC days, and other ones resetted...

#

Didn't realize it was some kind of red team CTF...

pastel creek
#

hello guys , any suggestions for pythoh libraries to help me in competitive programming ?

#

such as this advent : )

drowsy sleet
#

for this event oyu don't need any libraries

ripe meteor
#

You're probably going to use deque, bisect, itertools at some point

#

And for 3rd party, maybe networkx

low condor
void nacelle
#

&aoc join

ripe meteor
#

Also not even specific to AoC, you will use binary search, deques and graph libs in competitive programming

low condor
#

Strictly speaking, no solution discussion is allowed here - except for light guidance in spoiler tags. Discussion of what packages would be useful is light guidance. Acknowledge the line is blurry though

mossy basin
#

this doesn't seem spoilery to me

low condor
#

I’m just going off what it says in #aoc-faq about light guidance

mossy basin
#

there's not light guidance -- no problem is even being discussed

#

the difference between saying bisect is useful in general and bisect might be useful for problem x

low condor
#

I don’t think that’s a clear line that has been demarcated in the FAQ channel, but ok

gleaming cedar
#

people doing aoc in excel deserve this

cunning scarab
#

Everyone ready for 2d arrays?

#

Manhattan distance

lusty rover
gleaming cedar
woven oriole
#

soon ™️

pastel creek
shut trellisBOT
#

Sorry, an unexpected error occurred. Please let us know!

CommandInvokeError: Command raised an exception: NotFound: 404 Not Found (error code: 10008): Unknown Message

hidden musk
#

😔

polar sand
#

I think both would still be possible though, but manually parse the d5 puzzle starting point?

spice robin
#

I just started my AOC 5 days late

#

Do I lose points for that?

minor cave
#

You just won't gain as many since other people have completed the puzzles faster already

spice robin
#

How about in our private leaderboard

#

Is it also based on speed?

minor cave
#

Yeah, we follow the same scoring rules, just with a lot more people on a leaerboard

spice robin
#

Oh well, I guess I'll personally rank myself with the stars I get this year

fossil cipher
minor cave
#

We will be doing the Advent of Code Completionist role again this year, where people who get all 50 stars get a fancy pink role for the month of January to acknowledge the achievement

heady pollen
#

Ok thank you

#

And sory

fossil cipher
#

np 🙂

spice robin
minor cave
spice robin
#

Done! Thank you

alpine pike
#

day 6 killing me

#

Idk what it wants

#

🥹

compact wasp
#

😔

alpine pike
#

your subroutine needs to identify the first position where the four most recently received characters were all different. Specifically, it needs to report the number of characters from the beginning of the buffer to the end of the first such four-character marker.

#

For example, suppose you receive the following datastream buffer:

mjqjpqmgbljsphdztnvjfqwrcgsmlb
After the first three characters (mjq) have been received, there haven't been enough characters received yet to find the marker. The first time a marker could occur is after the fourth character is received, making the most recent four characters mjqj. Because j is repeated, this isn't a marker.

hollow wharf
alpine pike
#

The first time a marker appears is after the seventh character arrives. Once it does, the last four characters received are jpqm, which are all different. In this case, your subroutine should report the value 7, because the first start-of-packet marker is complete after 7 characters have been processed.

alpine pike
#

how was the first start-of-packet marker completed?

brazen geode
minor cave
#

@alpine pike You can also open a help channel if you want people to be able to help you a bit more freely. Just make sure the title of the help post includes that it's for Advent of Code and for which day

alpine pike
#

okie

#

the start of a packet is indicated by a sequence of four characters that are all different.

#

OHHHH

brazen geode
#

This one takes a bit of reading

stray crescent
#

can some one explain what day 6 question means

elfin dirge
#

Any tips to understand the assignment faster? I noticed I spend almost 2/5 of the time, reading the assignment

brazen geode
brazen geode
elfin dirge
stray crescent
#

ooooooo

#

i read the question wrong

#

ffs

brazen geode
elfin dirge
#

Kk, I'll try to improve every day

#

Thanks

alpine pike
#

what does the 22 and 14 mean?

brazen geode
#

Probably derived from how much you solved in how much time

hollow wharf
#

Score based on how many people are in the leaderboard and the order each user solved

bleak sable
#

For n people in the leaderboard, the score goes: first person to solve task gets n points, second gets n-1... And so on, for all tasks.

Because "private leaderboard" is limited in size, bot stitches the small ones together and re-assigns the score in the same way, but for all people. Check &aoc lb on #aoc-bot-commands

stray crescent
#

i did all days except day 5

#

i am not parsing day 5's input

stable charm
#

doing these from my phone, hardest part is putting in the input lol

#

altho i assume logic gonna get tpo hard for mobile at some point

low condor
stray crescent
#

yeah thats the thing the old me would try hardcode it but now i always think about optimal solution so its really hard to force my self to hardcode

#

i will give it a try. not today tho maybe on a weekend

stable charm
#

are points distributed by who solves it first?

#

then 1 less per solve?

low condor
pine ravine
#

Mapped Hash set go brrrr

iron shadow
#

what lb did you get this from?

night berry
#

Yesterday's lb

iron shadow
#

on the aoc website?

night berry
#

Yeep

iron shadow
#

huh I can't find a lb that both of us are on 😅

#

or is this the global lb?

night berry
#

Not the global, it's the ChrisJL lb from [p]aoc join

iron shadow
#

&aoc lb

shut trellisBOT
#

Here's our current top 10 (and your personal stats compared to the top 10)! 🎄🎄🎄

     | Name                      | Score | ⭐, ⭐⭐
--------------------------------------------------
 213 | (You) ChrisJL             |  9190 | (6, 6)
   1 | Oliver Ni                 | 11935 | (6, 6)
   2 | Zeyu Chen                 | 11934 | (6, 6)
   3 | Kevin Sheng               | 11901 | (6, 6)
   4 | Defelo                    | 11890 | (6, 6)
   5 | Anonymous #1087784        | 11829 | (6, 6)
   6 | Starwort                  | 11819 | (6, 6)
   7 | Daniel Gu                 | 11797 | (6, 6)
   8 | RadioactiveHydra          | 11788 | (6, 6)
   9 | Adavya Goyal              | 11786 | (6, 6)

The leaderboard is refreshed every 30 minutes.
Last Updated: <t:1670347525:t>

Number of Participants

998

Full Leaderboard
iron shadow
#

ahhh

#

just 300 points away Eyes

tepid cairn
#

I havent had the time to start five yet 😔

#

fingers crossed I can crank both of these out today

iron shadow
#

They're not too bad

#

day 6 is easier than 5 imo

tepid cairn
#

I've glanced at five, seems like the bigger problem will be parsing

iron shadow
#

day 5 mostly a parsing problem :P

#

lol yea

#

salt's aoc lube lib is nice for this

tepid cairn
#

that's what I'm using too!

iron shadow
#

some useful utils

tepid cairn
#

more-itertools is something I'll keep alongside as well

iron shadow
#

yea

#

haven't had to use that just yet

#

salt's lib includes a couple of similar funcs namely chunk, split etc

worthy escarp
#

anyone else struggle day4 pt1?

#

im checking my test output and it should absolutely match so im a bit confused

sage bronze
#

&aoc lb

shut trellisBOT
#

Here's our current top 10! 🎄🎄🎄

     | Name                      | Score | ⭐, ⭐⭐
--------------------------------------------------
   1 | Oliver Ni                 | 11947 | (6, 6)
   2 | Zeyu Chen                 | 11946 | (6, 6)
   3 | Kevin Sheng               | 11913 | (6, 6)
   4 | Defelo                    | 11902 | (6, 6)
   5 | Anonymous #1087784        | 11841 | (6, 6)
   6 | Starwort                  | 11831 | (6, 6)
   7 | Daniel Gu                 | 11810 | (6, 6)
   8 | RadioactiveHydra          | 11801 | (6, 6)
   9 | Adavya Goyal              | 11798 | (6, 6)
  10 | Oof                       | 11777 | (6, 6)

The leaderboard is refreshed every 30 minutes.
Last Updated: <t:1670352420:t>

Number of Participants

999

Full Leaderboard
placid lake
#

woahh it's nekit

#

hello hello

sage bronze
#

heyy

#

how's it been?

placid lake
#

long time no see

#

quite good, you?

sage bronze
#

indeed

#

same, actually

placid lake
#

that's good to hear

sage bronze
#

same here, heh

#

I'm surprised people remember me

placid lake
#

how could i forget

#

you were around when i was most active here

sage bronze
#

heh, fair

tepid cairn
#

.aoc lb AbooMinister25

#

rip

#

&aoc lb AbooMinister25

shut trellisBOT
#

Here's our current top 10 (and your personal stats compared to the top 10)! 🎄🎄🎄

     | Name                      | Score | ⭐, ⭐⭐
--------------------------------------------------
 337 | (You) AbooMinister25      |  5441 | (4, 4)
   1 | Oliver Ni                 | 11947 | (6, 6)
   2 | Zeyu Chen                 | 11946 | (6, 6)
   3 | Kevin Sheng               | 11913 | (6, 6)
   4 | Defelo                    | 11902 | (6, 6)
   5 | Anonymous #1087784        | 11841 | (6, 6)
   6 | Starwort                  | 11831 | (6, 6)
   7 | Daniel Gu                 | 11810 | (6, 6)
   8 | RadioactiveHydra          | 11801 | (6, 6)
   9 | Adavya Goyal              | 11798 | (6, 6)

The leaderboard is refreshed every 30 minutes.
Last Updated: <t:1670352420:t>

Number of Participants

999

Full Leaderboard
minor cave
tepid cairn
#

oh huh, I was wondering why it wasn't happening by default, thanks

#

&aoc link AbooMinister25

shut trellisBOT
bleak sable
#

Please stick to the topic of the channel. This channel is about Advent of Code, not general python help. Person asking was already redirected out of this channel

silver wyvern
#

So day 6 was quite easy... does this mean day 7 will be punishing? 😝

fast kite
#

anyone here have experience in machine learning?

unique osprey
tepid cairn
#

I got like, three questions in last year, so I don't have much of a point of comparison

#

I'll probably somewhat get through the entire thing this time

silver wyvern
#

I didnt do last year to be fair. Did ok in 2020 though. Perhaps they made it easier to make it a bit more accessible?

tepid cairn
#

maybe we'll have a drastic explosion in difficulty tomorrow

next viper
#

What's the name of the leaderboard for this discord? I joined it but I already had a couple other ones and I'm not sure which one is which :/

silver wyvern
#

&aoc lb

shut trellisBOT
#

Here's our current top 10 (and your personal stats compared to the top 10)! 🎄🎄🎄

     | Name                      | Score | ⭐, ⭐⭐
--------------------------------------------------
 218 | (You) Ed                  |  9192 | (6, 6)
   1 | Oliver Ni                 | 11947 | (6, 6)
   2 | Zeyu Chen                 | 11946 | (6, 6)
   3 | Kevin Sheng               | 11913 | (6, 6)
   4 | Defelo                    | 11902 | (6, 6)
   5 | Anonymous #1087784        | 11841 | (6, 6)
   6 | Starwort                  | 11831 | (6, 6)
   7 | Daniel Gu                 | 11810 | (6, 6)
   8 | RadioactiveHydra          | 11801 | (6, 6)
   9 | Adavya Goyal              | 11798 | (6, 6)

The leaderboard is refreshed every 30 minutes.
Last Updated: <t:1670355188:t>

Number of Participants

999

Full Leaderboard
silver wyvern
next viper
coarse glen
#

can someone help me with day 3

low condor
coarse glen
#

wait i think i got it haha

#

1 sec

coarse glen
sharp panther
halcyon pulsar
#

are the days supposed to be getting harder

hollow wharf
#

No worries, they will...

halcyon pulsar
#

i see

#

damn only 131 on day 24??

rugged merlin
#

&aoc lb

shut trellisBOT
#

Here's our current top 10! 🎄🎄🎄

     | Name                      | Score | ⭐, ⭐⭐
--------------------------------------------------
   1 | Oliver Ni                 | 11959 | (6, 6)
   2 | Zeyu Chen                 | 11958 | (6, 6)
   3 | Kevin Sheng               | 11925 | (6, 6)
   4 | Defelo                    | 11914 | (6, 6)
   5 | Anonymous #1087784        | 11853 | (6, 6)
   6 | Starwort                  | 11843 | (6, 6)
   7 | Daniel Gu                 | 11821 | (6, 6)
   8 | RadioactiveHydra          | 11812 | (6, 6)
   9 | Adavya Goyal              | 11810 | (6, 6)
  10 | Oof                       | 11789 | (6, 6)

The leaderboard is refreshed every 30 minutes.
Last Updated: <t:1670358690:t>

Number of Participants

1000

Full Leaderboard
rugged merlin
#

hmm.. how do I have it recognize my name/entry here?

halcyon pulsar
shut trellisBOT
halcyon pulsar
#

and then your username

#

probably in bot commands

hollow wharf
halcyon pulsar
#

im tryna solve it now

#

i doubt ill get far

hollow wharf
#

Both parts got solved by the 13k+

halcyon pulsar
#

what?

#

ohh

#

right

#

thats fine then

hollow wharf
#

Yeah as said, only 100 got stuck with part 2

rugged merlin
#

is the leaderboard over all years or just this year?

hollow wharf
#

Just this year

rugged merlin
#

hmm... as I look at the leaderboard on the website, results are different

hollow wharf
#

Leaderboards are split

#

You can't have more than 200 users per leaderboard

#

Hence there are like 10 or something leaderboard for the server

#

You belong to one of them

rugged merlin
#

ahhhh got it

#

was going to say, there is way too much talent on this server for me to be in the top 30 😆

hollow wharf
#

And the command uses the same formula across all leaderboards

halcyon pulsar
#

Can I ask for help for last years day 24? pithink

spice robin
#

Oh no I'm 404 on the leaderboard

#

Participant not found

torn thorn
#

rip

wet pier
#

where can i see the advent of code "list"

#

i only just learned about this now

#

keep forgetting these types of channels exist

woven sable
#

what are y'alls strategies for reading the aoc puzzles if anything

#

kinda a dumb question but like

#

do you guys just read the bolded text, skim through, etc

lusty rover
#

I just lazily read through the whole thing because I enjoy the story firHide

tepid cairn
#

I read the entire thing >.>

torn thorn
#

usually a few paragraphs after the start

wet fiber
#

then how will you know whether or not the expedition for star fruit is going smoothly? :(

urban locust
#

I go to where it explains what the input means and then go back and read the exposition

feral hazel
#

at times I start by looking at the input then write a bit of parsing code
it gives context for when I skim through the prompt

livid gull
#

i love when my pc randomly shuts down and now is taking forever to load

earnest forge
#

Well you've got 10 minutes

#

Hopefully that's enough

livid gull
#

or ive got to do it on phone :/

placid lake
#

hello hello hello

#

i'm not being late to this one

#

but i bet this is the one that screws us all over

earnest forge
#

Frankly it's about time lmao

#

5 minutes, GLHF everyone

tulip elbow
#

still can't believe Morocco beat Spain

limber aurora
torn thorn
#

&aoc c

shut trellisBOT
#

Day 7 starts <t:1670389200:R>.

torn thorn
#

where is everyone :(

naive stone
#

i'm here

torn thorn
#

hola

placid lake
torn thorn
#

lmao

#

any reason why it has been so easy

#

like these

#

past couple of day

limber aurora
#

to set us up for the most disgusting problem ever

torn thorn
#

💀 💀

#

crt trust

#

day 7 crt

placid lake
#

nooo

#

not crt again

earnest forge
#

GLHF

placid lake
#

it's okay, sympy had something for that

torn thorn
#

glhf everyone

placid lake
#

bye

#

gl

limber aurora
#

good luck everyone!

shut trellisBOT
torn thorn
#

what the FUCK

#

wow

hoary trout
#

what the

#

lol

urban locust
#

Very interesting

hoary trout
#

went from 0 to 100

wet fiber
#

alright looks like it got harder huh

urban locust
#

Just a tad

midnight hazel
#

hmm bit difficulty jump

urban locust
#

Not that much harder than finding four unique letters in a row, right?

midnight hazel
#

well i did that in 20 lines of code

#

this will be harder i guess

pine tiger
#

what???

green scarab
#

the jump in difficulty from day 6 to day 7 is insane. This one is particularly hard since it seems I can't use dicts

pine tiger
#

no, u can

green scarab
#

there are different directories with the same name tho?

pine tiger
#

||you don't just use the folder name as the key||

minor cave
humble copper
#

tragic

#

i misread part 2 3 times

torn thorn
#

rip

#

same but once

pine tiger
#

fff

modern harness
#

I started 3 minutes late. Luckily an additional 3 minutes on top of a 20 minute problem isn't the worst handicap. Not nearly as bad as it would've been if I had started 3 minutes late, say, yesterday.

flat sequoia
#

yeah yesterday was really easy for some reason

#

i think 3 minutes would already take you off the leaderboard

trail flare
#

love when my code works for the example but not my input

flat sequoia
#

are you relying on directories having unique names?

trail flare
#

nope

flat sequoia
#

rip

torn thorn
#

do directories have unique names

#

i never checked

flat sequoia
#

no

trail flare
#

wait can 2 folders in the same dir have the same name?

pine tiger
#

apparently they don't

torn thorn
#

damn

torn thorn
#

luckily 💀

trail flare
#

ok then my code should work fml *made a dumb mistake

humble copper
#

i've somehow committed myself to the same challenge i did last year

#

where i'd try to do each problem without any imports at all

#

even stdlib

earnest forge
#

I got bopped

#

Out of top 1k for the first time

#

:(

torn thorn
#

rip

#

1k still good when compared to 200k people participating

flat sequoia
#

imagine being locked out of regular expressions

humble copper
#

it was hell last year

#

couldnt even use like simple mazesolving stuff unless i recreated it from scratch

flat sequoia
#

well it's not like that's in stdlib anyway

humble copper
#

yeah ig

flat sequoia
#

holy shit

#

i just realized

#

there's nothing stopping me from just importing networkx or something

humble copper
#

lol yep

earnest forge
flat sequoia
#

it'll tell you in /leaderboard/self

earnest forge
#

Oh it's 10k for leaderboard/self neat

earnest forge
#

Yeah 2574/2099

hollow wharf
#

does this thing backtracks weirdly?

#

like this cd / switches the current directory to the outermost directory, /. is only for / right?

#

or is it for any directory in the tree?

#

i mean, does it work like actual cd, or is it jumping weirdly, part 1

modern harness
hollow wharf
#

dont use the examples

woven sable
#

this saved me

#

i wsa stuck for a while lmao

elfin dirge
#

fck that took me too long

rugged merlin
#

yeah took me a while too, I misread part 2 like an idiot and thought it was asking for the directory name 🤦‍♀️

modern harness
elfin dirge
hollow wharf
#

I didn't read it work like real cd

#

Yeah, i know cd / jumps to /

#

but i didn't understand if that meant it only jumps to /, or if it means you can jump to anywhere

#

given the input has only one "cd /"

left yew
#

my input has only one $ cd /

#

at the top

trail flare
hollow wharf
left yew
#

and again my code works for example and not the input 😭

flat sequoia
hollow wharf
#

dont use the examples, there's like this inclination to use them as tests

#

they are not

#

they are examples

trail flare
hollow wharf
#

as long as you understand what they are showing thats ok

flat sequoia
#

Nothing wrong with using the examples as tests

hollow wharf
#

but they are not tests

left yew
#

they help flesh out stupid mistakes

naive stone
#

lol done. That took me very long, but it was also very fun

left yew
#

now have to worry about the edge cases

modern harness
hollow wharf
left yew
#

I found one edge case so far

flat sequoia
#

There are edge cases?

left yew
#

make that 0

#

I didn't find any

modern harness
flat sequoia
#

I don't think there are any prominent edge cases here

modern harness
#

woops, replied to the wrong comment

flat sequoia
#

15 was the only one from 2018 I did

#

maybe i'll try 20

#

Wait jk I also did problem 5

#

but weirdly I don't have my code for that day

modern harness
# flat sequoia maybe i'll try 20

Jumping around can be a little odd at times because some problems build on problems from earlier in the month, though maybe some of them you'd pick up on that from the problem description.

#

Though 20 is a standalone, I was just thinking about 2018 problem 19 which builds on problem 16

flat sequoia
#

i see

#

oOh this problem is interesting

#

part 1 doesn't seem too bad

naive stone
#

2018 day 23 is one of my all time favorites

willow fractal
#

this problem is interesting :) I've managed to get the examples right but the real incorrect

hollow wharf
#

uff im too drunk for this

#

im getting 0 🤣

flat sequoia
#

oops i got sidetracked

#

i'll give 2018 day 20 a try now

young oriole
#

So part 1 i am getting the test just fine, however, my input is returning to low. Not sure where to go

hollow wharf
#

god

#

did it

hollow wharf
#

if you got the example working, most likely you are missing this, at least its what i was missing:

#

In the example above, these directories are a and e; the sum of their total sizes is 95437 (94853 + 584).

#

a = a + e, but you also need e

young oriole
hollow wharf
#

the answer is in the 1m

hollow wharf
young oriole
#

and if I look at the values it returns both a and e as the totals under 100000. Yeah I am in the 1m range

#

true, I get that. I didn't write a test around it. Should have called it an example

hollow wharf
#

whats your number

young oriole
#

right <=

young oriole
willow fractal
restive imp
#

Finally done... I'm not made for solving those riddle quickly. At least not at 6 a.m.

modern harness
restive imp
#

I get up earlier than usual, yes xD

#

But only since I have to go to work anyways. I won't get up early on weekends

modern harness
#

I'll take my 11 pm over 6 am though

hollow wharf
#

taking only into account the size of a

spice palm
#

Can anybody suggest learn to odd frame work chanel or any course

restive imp
hollow wharf
#

trying to do it fast is pointless

#

unless you are into that sort of stuff

willow fractal
#

(i'm getting the opposite issue, too high)

restive imp
hollow wharf
#

the thing is competitive programming has a meta like any competitive scene in videogames

#

the only example i know cause i played it in the pandemic is aoe

#

you can either play it normally, or play it competitively, where you need to reach certain goals at certain clock times

restive imp
hollow wharf
#

there is an entirely different meta-game to that, you need to learn build orders and set your shortcuts and stuff to reach that timing

hollow wharf
#

code golf can be done slowly

modern harness
hollow wharf
#

thats cool

restive imp
#

By the time I have read and understood the riddle the leaderboard is full 😂
At least for the first few days

modern harness
hollow wharf
#

If you are interested in the timing aspect you should look into the competitive programming meta

restive imp
#

Well, I have to go to work now. Cya

hollow wharf
#

Its mostly about learning a bunch of common data structure and algorithms and building a system for quick snippets

halcyon pulsar
#

@mossy basin

#

Sorry, for the ping, but aoc_lube is raising an error

#

probably because im on windows

earnest forge
#

I'm not salt but what's the error?

halcyon pulsar
#

FileNotFoundError: [Errno 2] No such file or directory: 'C:\\Users\\caeden\\AppData\\Local\\Programs\\Python\\Python310\\lib\\site-packages\\aoc_lube\\code_template.txt' - Should I write the template myself, or is it in some other dir?

earnest forge
#

That's weird

mossy basin
#

that is weird

woven solar
#

I saw that too, I think it's a bug and the default template file doesn't get packaged into the builds

mossy basin
#

i didn't know that

earnest forge
#

Stupid question but does that also happen with aoc_helper? (aoc template)

dense nacelle
#

I know .ini files don't get packaged. Maybe .txt files are the same way.

mossy basin
#

i'll fix it, but you can copy the template from the github if you want

halcyon pulsar
#

i've copied it in so no rush

mossy basin
#

oh never mind, that's true by default

mossy basin
mossy basin
earnest forge
mossy basin
#

oh, just a me problem then

potent tapir
#

My code for Day 7 Part 1 works on the example, but not on my puzzle input

proven pasture
#

Does anybody know a way to download the input? I'm trying to do the task on my phone (cuz I'm at school) and can't copy the whole thing (the phone just won't let me)

marsh currentBOT
#

Hey @tidal kelp!

You either uploaded a .txt file or entered a message that was too long. Please use our paste bin instead.

potent tapir
#

inputs are different per person

tidal kelp
potent tapir
#

yeah

tidal kelp
#

didnt know thanks for pointing that out

stable charm
#

also andriod has this button

#

idk about ios

proven pasture
#

The option just disappears

stable charm
#

aah rip

proven pasture
#

And the download button downloads a pdf

#

And after conversion it uses weird $

#

That python doesn't see as dollars

stable charm
#

after openinh?

#

i think u can,change encoding

#

cause that sometimes messes things up

#

im getting a txt download so i have no clue why your getting pdf

pastel creek
#

can someone help me , it is compiling but giving wrong answer

brazen geode
pastel creek
#

ty

naive gust
#

Yay more parsing

#

😐

gleaming cedar
#

boo parsing

potent rivet
#

parsing is the most important part of life ... 😢

fossil cipher
#

Parsing is fun!

elfin dirge
woven oriole
past comet
#

ah butts, today involves tree navigation

#

I might actually want a class to handle some of this

naive gust
#

Yeah I was thinking of each folder being a class

#

A lot easier than dictionaries

stable charm
#

i think imma have to use example input, logic doesnt seem to work lol

#

and far too much atm to debug properly

#

oh wait they give a small example input

#

thats pretty useful

#

probably on purpose too

#

bruh moment, mistake was wrong indentation, which i only made cause mobile programming is weird lol

broken cradle
stable charm
#

ok took way too long but day 7 done!

past comet
#

ooh boy, there are a lot of moving parts in this, if I don't get it right on the first guess debugging this will be unpleasant

low condor
past comet
#

true, i should set up some generic unit test scaffold at some point

tepid cairn
#

ipython is nice for this kind of stuff, sticking your test input into the REPL and messing with it to see what works

low condor
#

I just use PyCharm :) Sticking a breakpoint somewhere and looking at the variables in the variable explorer is my favoured approach

polar sand
#

print()

low condor
#

print() is good but can be a pain for structures with multiple levels

#

With PyCharm you just have drop-down arrows for each level, which is sweet

past comet
#

man, really hoping all the directories have unique names

#

welp, that's me all buggered

gleaming cedar
#

tfw test input works but not the actual input 😭

unique osprey
gleaming cedar
#

wait a minute, there can be duplicates?

#

ignoring the path ofcourse

unique osprey
#

🤷‍♂️ My implementation wouldn't have cared so IDK

covert arrow
gleaming cedar
stiff wasp
#

Are there any spoilers at the bottom of day 7 channel rn?

covert arrow
#

Nope

#

You can ask in the help forum channel as well as long it says in the title

normal umbra
#

day 7 was cool

halcyon pulsar
#

still having problems with aoc_lube

#
import aoc_lube

RAW = aoc_lube.fetch(year=22, day=7)
print(RAW)``` is raising `Request failed`
#

I am supposed to copy the token from the value of the session cookie in the adventofcode.com request, right?

earnest forge
#

Yes

halcyon pulsar
#

Odd

earnest forge
#

See if you can find your cookie

#

It should be in something like ~/.config/aoc_lube/session.txt

#

Not sure exactly the path aoc_lube uses

halcyon pulsar
#

When I print session in the aoc_lube source code it prints the token as bytes instead of hex, is that what is supposed to happen? For some reason its converting my hex token to bytes ```py
TOKEN = {"session": TOKEN_FILE.read_text().strip()}
print(TOKEN)

earnest forge
#

¯_(ツ)_/¯

#

That's a question for salt more than me

#

Btw when you say 'it's converting [your] hex token to bytes' do you mean it's printing {'session': b'<your token>'}?

halcyon pulsar
#

not sure what exactly those are called actually

earnest forge
#

\x00 is null

#

What OS are you on?

#

(actually, what editor do you use?)

halcyon pulsar
#

Windows

#

Vscode

earnest forge
#

Ok open your token file with VSCode and tell me what encoding it uses

#

It'll tell you in the status bar

halcyon pulsar
#

UTF-16 LE

earnest forge
#

Yeah that'll be it

#

Click UTF-16 LE and select 'save as encoding'

#

Then choose UTF-8

halcyon pulsar
earnest forge
#

Is your token 128 characters long?

#

And make sure there isn't a \n at the end

halcyon pulsar
#

yep

#

and no \n

#

it would get stripped anyway

earnest forge
#

Then your token might be expired; try re-fetching your token out of your cookies

halcyon pulsar
#

Opened a new tab and the token was the same

#

Very odd

earnest forge
#

Have a go using aoc_helper and see if it still doesn't work

#

What version of aoc_lube are you using btw?

halcyon pulsar
#

0.2.5

#

i'll try aoc helper

#

just updated to 0.2.6 and same problem

#

Huh, worked the token worked with aoc_helper in cli

earnest forge
#

@mossy basin something is broken with your request handling, see @halcyon pulsar's problem above

halcyon pulsar
#

I figured out his problem

#

Its returning 404 because its trying to make a request to https://adventofcode.com/22/day/7/input

#

when its 2022 not 22

earnest forge
#

Ah

halcyon pulsar
#

Not sure why it works on linux

#

I assume other people aren't having problems somehow

earnest forge
#

I think you're just supposed to pass the full year

#

Don't remember if there's a check for that in aoc_helper or not

halcyon pulsar
halcyon pulsar
#

RAW = aoc_lube.fetch(year=22, day=7) this is what is generated from the template

earnest forge
#

ok no aoc_helper does not contain a check for year < 2000

halcyon pulsar
#

Just added this file.write_text(template.format(year=f"20{year}", day=day))

#

There we go

#

Works now

earnest forge
#

lmao you're supposed to do 2022 not just 22

#

Btw @woven sable how has fixing the testing stuff from your PR gone?

tepid cairn
#

ah yes, AOC 22 AD

earnest forge
#

If it doesn't work I might just revert that pull

earnest forge
#

How many rocks are in your input?

tepid cairn
#

lolol

earnest forge
#

(1201)

halcyon pulsar
#

interesting problem today

#

i like it

#

how long has it taken you guys to solve

tepid cairn
#

I've been bogged down by schoolwork 😔

#

haven't started yesterday's yet

fossil cipher
#

A few hours for me this morning. Partly due to brain being slow. Partly due to an assumption being wrong that took me a hot minute to work out (the dreaded the test input works but real input didn't moment).

lusty rover
#

A couple of hours

broken cradle
#

I’ve been bogged down by advent of code

#

haven’t finished my schoolwork yet

lusty rover
#

I'm slightly less embarrassed now

tepid cairn
#

I have free time today, at least

fossil cipher
rugged merlin
#

man, was feeling great when I checked where I was on the leaderboard before going to bed last night (51) and then checking against this morning was a real downer (80) 😆

guess it's still a net upward migration, as I started out at 97

halcyon pulsar
#

i've gotten all of the files in a directory form but im stuck on the recursion part, rip

#

did you guys use classes

drowsy sleet
#

yay first time I'm struggling this year

#

mostly because my code is too ugly to debug

timber glacier
#

What language should i learn by doing aoc

halcyon pulsar
#

c++

timber glacier
#

Currently doing python but looking for a language i dont know

#

I'm already using c/c++ in robotics, i want to learn a new language

timber glacier
#

Why is everyone suggesting rust lol

#

I'll try it but dang

tepid cairn
#

rust rust rust rust

earnest forge
#

It's a compiled language that has speed comparable to C and ergonomics comparable to Python (after you get your head round the borrow checker)

timber glacier
#

Borrow checker?

earnest forge
#

Stops you from committing UAFs, data races, double frees, etc.

polar sand
#

Took me about an hour for first part and an additional hour for part 2 cause I misread instructions and thought something was wrong with my code and never went back to instructions

timber glacier
#

Rip

polar sand
#

Had to ask in the spoiler chat if I was being stupid or not, and I was indeed being stupid running on 5 hours of sleep without coffee

earnest forge
#

Rip

polar sand
#

This is my first time doing aoc seriously. How many days can I expect the difficulty to be at this level before there's another jump?

earnest forge
#

This year already has a much different difficulty curve than the other years

timber glacier
#

Its mostly been parsing this year

earnest forge
#

It's usually a fairly reasonable curve up to the 24th (then day 25 is easy because yk it's christmas, gotta be nice and fast)

#

It's also usually easier on weekends

polar sand
#

Easier on weekends is a nice touch. Sounds like my goal of reaching at least day 18 is probably feasible then since it ends on a Sunday, so I'll hopefully get a few easier puzzles

timber glacier
#

I think I'll do rust this year and elixir next year

earnest forge
polar sand
#

I plan on going for all 25, but I do want to reach at least 18, after that if puzzles take me too long I'll do them over multiple days just to try and complete it

tepid cairn
#

time finally freed up, I can get to 6 and 7 now 🎉

earnest forge
#

Nice

urban locust
#

Nice!

#

6 is super difficult

polar sand
#

Awesome, good luck on that 6

earnest forge
#

kekw

modern harness
#

I'm really stuck on 2018 day 20. I don't even know if I'm messing up somewhere in calculating the map from the regex or calculating the farthest room once I have the map. I can't find any flaws in either and both of them work on all 5 test cases. Could someone that has a working solution see how many doors my input produces: https://paste.pythondiscord.com/raw/oronaqedeh

earnest forge
#

Oh god it's that one LMAO

#

Instead of telling you your answers (generally frowned upon) I'll give you my input and answers

#

And you can treat it like a test case

drowsy sleet
#

fuck, my parser is wrong.. I now tested multiple ways of calculating the sum and they all add to the same

modern harness
earnest forge
#

One mo

drowsy sleet
#

ohhhhhhhhh I only need the directories fuckkkkk I read the task wrong nooo

earnest forge
#

And yeah my laptop doesn't even have my 2018-20 solution on it lmao

#

That must be on my desktop

modern harness
tepid cairn
#

part 1 done 🎉

#

part 2 done 👀

lusty rover
tepid cairn
#

lolol

#

apparently seven is harder

lusty rover
#

You think?

#

Just wait

tepid cairn
#

ah woah

#

at least parsing doesn't seem like it'll be too bad

earnest forge
#

(apparently it's in Luxembourgish)

tepid cairn
#

eh whatever I'll do this later

lusty rover
tepid cairn
#

later 😔

lusty rover
#

Suffer with the rest of us

modern harness
#

with your input

normal umbra
#

if so, for which day?

earnest forge
modern harness
normal umbra
#

ah 2018

normal umbra
surreal sky
#

I would post code but I’m doing it in a different language then python

halcyon pulsar
#

I don't think its wrong, you have probably just misunderstood the assignment -

surreal sky
#

Wdym

tepid cairn
surreal sky
#

Yep, I’m just confirming I have everything understood correctly

halcyon pulsar
#

its been 3 hours now im dying

unique osprey
#

Work with the sample input. Make sure your structure is exactly as it is in the example

halcyon pulsar
#

Its like half way down 😢

#

I'll try working along

unique osprey
#

Does your code work with example?

earnest forge
#

Check that ||absolute cds|| work correctly, I had a bug where it would completely break my cwd

halcyon pulsar
#

I'll work down my input

wispy glacier
#

these are spoiler discussions and need to be spoilered in full @halcyon pulsar @unique osprey

#

this also needs to be spoilered @surreal sky
thanks

surreal sky
#

Oh ok

wispy glacier
halcyon pulsar
#

👍

unique osprey
#

sorry, didn't seem like a spoiler but i guess any hint/observation counts

wispy glacier
#

if you don't want to fully spoil yourself with #1047673173447020564, you can discuss here with lots and lots of spoiler tags ||like this|| with the relevant day/part # stated