Day 06

[heavy raft]

Day 6: Tuning Trouble
Solve it here: https://adventofcode.com/2022/day/6
View leaderboards here: https://adventofcode.com/2022/leaderboard/private/view/419899?order=stars
you should watch bocchi the rock

[loud matrix]

comp back on top of his game

[heavy raft]

easy day

still cant beat dim

dang sweatlord

https://github.com/1Computer1/advent2022/blob/main/solutions/Day06.hs @sleek wagon

[lament ice]

that was fun

I started doing something that was bad and realized there's a very easy way to do it

[sleek wagon]

lmaong

pythong ||https://hastebin.com/ozekamivoh.coffeescript||

honestly took me too long to read the problem

[lament ice]

yeah, reading takes a bit

[sleek wagon]

mainly cause i didnt expect the solution to be so simple

since yesterday was way harder

[heavy raft]

i was off by one and got hit by the timeout rip

[sleek wagon]

damnn

i got fucked by the timeout on day 5

[lament ice]

I just spent half a second making it even better after I submitted part 2, now part 1 - part 2 is changing 2 chars

[sleek wagon]

i mean day 4

waited 5 minutes twice in a row

[heavy raft]

my exams start in two days so

youre the only speedrunner left

[sleek wagon]

my first exam is wednesday

data mining

at 5:45-7:45 pm

[lament ice]

I actually think the ts / js solution is quite clever

https://github.com/ckohen/adventofcode/blob/main/archive/Day6.ts

[sleek wagon]

oh comp you made the thread before starting the challenge

[heavy raft]

yeah

[sleek wagon]

how much time did that take

[heavy raft]

like 30 seconds

i dont mind

part of it is so that i get to put anime recommendations in the op

[lament ice]

Well it only really needs to take as long as opening the puzzle and writing the name here

you can have the rest pre-typed

[left loom]

https://github.com/iShibi/AOC-MMXXII/tree/main/src/day_6

[sleek wagon]

is anyone going for the most optimized solution

most solutions now are O(kn) where n is the length of the string and k is the number of unique chars

but it can be done in O(n)

[static merlin]

https://github.com/appellation/aoc2022/tree/main/06

[pale arrow]

Well that was easy

https://github.com/monbrey/aoc2022/tree/main/src/06

[pale arrow]

Ayy I did this too

Easiest part 2 ever

[wintry halo]

i think mine is O(n)

https://github.com/itsUrcute/aoc/tree/main/2022/day_6/part_1.mjs

[wintry halo]

i made part 1 work with any marker length already so part 2 is literally nothing

[pale arrow]

Yeah lol

[uncut jetty]

ezpz

cant wait to parse 100x100 mazes tomorrow

[teal prairie]

https://github.com/cheeze2000/aoc/tree/main/2022/06 kinda fun

[wintry halo]

we kinda did the same thing i guess except i used a hashmap instead of an array

[teal prairie]

i haven't seen yours, wait

[uncut jetty]

https://github.com/vzwGrey/aoc-2022/blob/main/src/day6.rs

[teal prairie]

oh i guess yea

[wintry halo]

should be O(n)

[rain pier]

https://github.com/megatank58/adventofcode2022/blob/main/src/day06/part2.rb that was easy

[rich plaza]

todays was easy ||```rs
fn find_packet_start(data: &str, size: usize) -> usize {
let chars = data.chars().collect::<Vec<char>>();
let found = chars
.windows(size)
.enumerate()
.find(|(, xs)| {
let filtered: HashSet<> = xs.iter().collect();
filtered.len() >= size
})
.unwrap();

found.0 + size

}

<https://github.com/Fyko/advent-of-code/blob/main/2022/06/src/main.rs>

[red hatch]

https://github.com/SynysterZV/aoc/blob/master/2022/src/Day6/index.ts ezpz

[uncut jetty]

set also a size property

[red hatch]

man

[red hatch]

is fixed

I overcomplicate things in my head

[slender void]

you shouldn't look at my solution then

[red hatch]

you threw in some error cases, nice

[slender void]

just for the sake of it lol

[red hatch]

I feel like you couldve made it easier by just splitting the input in the first place

[slender void]

eh, that would at best change iterating over string chars to iterating over array elements

i would still need an index in this way, which means i would still use c for loop

unless i would do for..of and have a separate index but that's just

[lament ice]

strings are effectively arrays of chars, don't know why i've seen so many split("") s today

[slender void]

yeah

and only reason why i make packets into array is so that i have less fucking around with the set

which arguably isn't cleanest, but hey it works

[red hatch]

well I kinda need mine to be an array cuz of findIndex sooo

[slender void]

(https://github.com/tipakA/AOC/blob/master/2022/TS/src/days/d06.ts for my btw)

[lament ice]

... .indexOf

[slender void]

get out of here with your brain

some of us don't have one

smh

[lament ice]

lol

I still think my solution is quite sexy

[teal prairie]

is it really

[red hatch]

indexOf requires a search string instead of a function smh

[slender void]

i do some fuckery before the loop cause i wasn't sure how to check in the loop if i should move the window or just add new

i can tell in hindsight, but

[quiet current]

Write-up-ish: https://github.com/GodderE2D/advent-of-code#day-6
Direct code: https://github.com/GodderE2D/advent-of-code/blob/main/results/2022/day-6/part-1.ts
Easy-hard-easy days loop

[red hatch]

cheeze did some unreadable fuckery for this one jesus

[quiet current]

i wanna see

[teal prairie]

i'd be surprised if anyone understands my solution tbh

[red hatch]

https://github.com/cheeze2000/aoc/blob/main/2022/06/a.cpp

[quiet current]

looks like fuckery

[red hatch]

looks like youre looping over a the string in windows checking if any 2 letters are the same in the window

[teal prairie]

eh 50% of the idea is there

[red hatch]

whats the other half

[teal prairie]

figure out what the variable a does

[quiet current]

mine is prob not the most efficient but i accept it already

[red hatch]

did you see mne

[quiet current]

let me see

[lament ice]

Shmexy

[red hatch]

https://github.com/SynysterZV/aoc/blob/master/2022/src/Day6/index.ts

[quiet current]

oh yeah thats cleaner

forgot .slice existed wtf

i used that like 10 times yesterday

[lament ice]

now...if you don't want to mutate things get very different

[teal prairie]

i mean, everyone's solution is just a variant of ||slicing + using set or make unique + compare set size||

[slender void]

smh

[red hatch]

well, yea

[teal prairie]

i don't see other solution that is different other than urcute's one

[red hatch]

and urcute is just doing the same thing except he made the map himself

[teal prairie]

yea true

[red hatch]

instead of using set

[teal prairie]

am i the only one that doesn't use a set 🥹

[slender void]

.

[red hatch]

lmfao

[granite needle]

does it keep a track of number of duplicates of any letter of the current marker?, a = 0 means there's no duplicates

[teal prairie]

[granite needle]

wow thats kind of smart of not using sets
mostly ppl are exposed to ideas of sets so thats what comes to mind first

[cinder moat]

i dont

[teal prairie]

same shit

[uncut jetty]

julia more like coolia

[cinder moat]

julia is poggers

[unique swift]

Inefficient as always xd

[wintry halo]

my solution is closer to cheezes than doing the slicing

because our solutions are in O(n) time while yours is in O(kn)

@teal prairie i stopped 2020 at day 6

but damn the questions are much easier now than it used to be in 2020 when i just started

[heavy raft]

k<=26 so it's all O(n) smh

[sleek wagon]

@heavy raft :angerycat:

[wintry halo]

k is substring size no?

it can be anything

[heavy raft]

pigeonhole

[wintry halo]

huh?

[heavy raft]

you can only have up to 26 before there has to be a duplicate

[sleek wagon]

well it has to be less than or equal to 26 cause there's 26 letters in the alphabet

[wintry halo]

oh yeah

[sleek wagon]

you can't have 27 unique letters

[wintry halo]

lets just imagine a version of the question where the character isn't limited to alphabets

[heavy raft]

that's the pigeonhole principle yeptune

[sleek wagon]

but if you're generalizing for problems including other chars then k can be >26

[heavy raft]

then cheeze would have to change some numbers

[wintry halo]

tru

but mine still holds

[heavy raft]

and by numbers I mean implement a map

[wintry halo]

ya that's what i did

[heavy raft]

so the problem is that map operations aren't constant time

[wintry halo]

huh?

set and get isn't O(1) ?

[heavy raft]

no

[wintry halo]

whaat

[heavy raft]

they're amortized constant

meaning over time they cancel out

[wintry halo]

close enough man

[heavy raft]

but by themselves they're not

[wintry halo]

[heavy raft]

[wintry halo]

is it the same for js objects

[heavy raft]

probably

[wintry halo]

yikes

[heavy raft]

just like how array append is amortized constant

the regrow is O(n) but you get back n O(1) appends, so they cancel out

[wintry halo]

using an array was my first thought tbh, you can just keep appending and changing start index instead of removing to keep it O(n)

i know it's amortized but cmon no one mentions it

[heavy raft]

no one knows what they're talking about

[wintry halo]

wait uhh

nvm

[wintry halo]

i know i always knew it but bringing it up every time is heavy akshually vibes

[heavy raft]

[wintry halo]

you can't deny it

but I didn't know it was the same for maps and objects

[wraith pulsar]

day 6 was easy

[wintry halo]

the part 2 felt kinda useless

[wraith pulsar]

yeah. i basically changed one variable

[granite needle]

today's one is prolly a calm before tomorrow's some storm

[wintry halo]

oh yeah

it always picks up at 7

i gave up at 7 my first try

[heavy raft]

well, that, and maps' running time is probabilistic, depending on where the hash function buckets things

[rain pier]

i don't use set either but then i don't really understand my own solution so

[wintry halo]

no one does

because it's more unreadable than a 3 year old's writing

[wraith pulsar]

i should have used set, but i just did a split and if the length > 2 i knew there was a duplicate 😂

[wintry halo]

split?

[rain pier]

i use a cool variable and unique arrays which i guess is technically just set with extra steps

[wraith pulsar]

https://github.com/afrozenpeach/adventofcode/blob/main/2022/6/6.js

[wintry halo]

it just looks like a variant of the slice approach to me

oh you split by each character

[wraith pulsar]

yeah

[wintry halo]

that's a unique one i guess

[wraith pulsar]

not a very clean approach but it works

[wintry halo]

not very efficient but unique

old me woulda died to use a regex here

[wraith pulsar]

i almost thought to use regex but then i thought better of it

[wintry halo]

no i mean a regex that straight up gives you the answer from the base input

it's gonna be a tough regex to write but i think it's possible

[wraith pulsar]

no i get what you mean

i almost did that

[wintry halo]

id be impressed to see a solution like that

cause that's not an easy regex to write imo

[heavy raft]

I don't think that should be hard

lemme see

yea

just generalize this to more chars

[uncut jetty]

well the easiest way would be to just enumerate all combinations with unique characters

[heavy raft]

/((?!\2).)((?!\1).)/

[wintry halo]

i can't immediately think of a way but my regex is pretty rusty

ill try it out later

[uncut jetty]

too much thinking comp, just bruteforce

[heavy raft]

but I just gave the answer

[uncut jetty]

yea but i mean

trivially you just do /(abcd)|(abce)|(abcf)|...|(vxya)|...|(vxyz)/

[heavy raft]

true, all finite languages are regular languages

[uncut jetty]

its only like 15,000 combinations

[wintry halo]

for every substring size yeahhh

[heavy raft]

this is O(nk)

[uncut jetty]

O(ink)

🐷

[wintry halo]

don't you mean O(n)

[heavy raft]

nope

it actually works for any alphabet

[wintry halo]

hmm?

oh you mean it's generalised ok

[heavy raft]

unless you wanna get into k<=#Unicode codepoints

[wintry halo]

i mean

sure

[heavy raft]

no frick you

[wintry halo]

frick you

[rain remnant]

https://github.com/JPBM135/advent-of-coding-2022/tree/main/day-06 Done

I actually liked what I did this time

[rich plaza]

folder with space

[rain remnant]

What space

Isn't this day 2006?

I should change it

I'm just lazy

[rich plaza]

im complaining about your folder names having spaces in them

[uncut jetty]

part 01 twice :(

[rain remnant]

Nice ctrl+c myself

[uncut jetty]

also why aren't you use template strings

[rain remnant]

I started using arrays in the start

For some weird reason

So, for now I just use it for consistency

[unique swift]

Arrays are good for this tho

||Shift and push||

[static merlin]

it may not have a space bc the link 404s

[rain remnant]

fixed

[slender void]

it literally just existed

[rain remnant]

fixed

[rain remnant]

just rename it, sorry Will

Edited the message now

[wintry halo]

eww shift

[unique swift]

Literally the first thing I thought of that could work

[dusky cypress]

oh, i see my approach was way too complicated once again
https://github.com/almostSouji/advent/blob/main/2022/06_tuning/solve.py
|| that unnecessary len call and weird window handling tho||

[dusky cypress]

appel elixir being pretty as per usual

[static merlin]

i wish the find_index callback was prettier

but that was the easiest way i could find to do it :(

[dusky cypress]

oh i'm such a dork for going back instead of starting at 0 and declaring the || moving window || forward

[rain remnant]

Yoah, that is some clean code

[rain remnant]

Nice one, so small, mine is a big boy

[cinder moat]

managed to shorten my Julia solution
||```julia
function findmarker(len::Int64)
    input = read("inputs/06.txt")

~-findfirst(i -> allunique(input[i-~-len:i]), len:length(input)) + len
end

[pale arrow]

Yeah this was pretty simple using pythons array indexing methods

And slicing

[rain remnant]

Nice!

I should take the time to learn python ngl

[sleek wagon]

I learned python for a data science course in college and then did aoc 2021 with it

now I'm good enough to use it for coding challenges

[pale arrow]

That's kinda my level too

Made a discord bot in discord.py
Used it for some process automation at work
Can do coding challenges

I just love the array[start:stop:step] syntax python has

[rain remnant]

It's really usefull

JS doesn't have anything close to it

[static merlin]

i hate python

[dusky cypress]

same, but it really influenced how bad my solution is today

because i guess my first thought was that i can use it nicely here
but then it's just gibberish - it works - but it's so much harder to read than if i just started at the beginning and added the || window size when outputting ||

[cinder moat]

omg no way me too #rust #puckfython

[pale arrow]

nah python good

[teal prairie]

my solution is superior than yours frick u

[uncut jetty]

advent of code

more like

advent of smelly

hahahahaha

[vast meadow]

ngl i liked this one today

but i wish part 2 was a bit more difficult

just consisted of changing a variable lmfao

[vast meadow]

where do you get the timed stats like these from?

oh i see in the leaderboard

im just blind lol

[pale arrow]

I think I was 5th last I checked

Which isnt bad for my shitty python stuff

But its the *s that really matter

[rain pier]

||```js
const distinctChars = 14;

console.log(
[...input].findIndex(
(_, i) => i-- >= distinctChars && new Set(input.slice(i - distinctChars, i)).size === distinctChars,
) - 1,
);

[rich breach]

nice

[wintry halo]

nah mine better

[teal prairie]

ok

[wintry halo]

yours can't be adapted to all alphabets

[teal prairie]

"hey, which phillips head screwdriver is better? A or B?"
"B, because A cannot screw a hexagon bolt"