AOC 2022 Day Six 📻

[doleraj]

Discussion of solutions for Advent of Code Day 6 here.

---

Don't forget about the VC Advent of Code private leaderboard:

Go to leaderboard/private
Use join code 363496-e6f42283

[doleraj]

https://github.com/doleraj/adventofcode/blob/main/aoc2022/src/day06/index.ts

I left my Dumb As Bricks™ part 1 unrefactored to prove I am a Real Developer: I write the dumb thing first and refactor later.

[turingtestable]

I did the same thing for part 1 since it seemed straightforward and I didn't want to look up set or uniqueness for an array, but fixed it with a commit. I still have a record of my Dumb as Bricks solution in commit history though.

I sort of like refactoring rather than trying to anticipate the specific way they are going to change things, whenever I try to be smart they tweak it a different way than i expect for part 2.

[clandau]

yea whenever I try to anticipate I'm wrong. today I lucked out.

[doleraj]

Yeah, sometimes I'll go back and change part 1 but this year is the year of No Effort.

[clandau]

https://github.com/clandau/advent-of-code/blob/main/2022/day-6/index.js

[tkshill]

Your code is always so accessible and easy to read. You must have the best PRs!

[bogdaaamn]

Very nice, I love it, I never remember how to use substrings (or work on string usually), I'd rather go for arrays, but also today I used slice

[danieltott]

Day 6! This was a fun little one 😁

https://github.com/danieltott/aoc2022/blob/main/src/day06/index.ts

[danieltott]

No you don't even need the spread operator!

[danieltott]

Oh this is wild - using a string and doing substr is actually noticeably slower than splitting the original string and using slice.

(new times in green)

-const parseInput = (rawInput: string) => rawInput.split("");
+const parseInput = (rawInput: string) => rawInput;
 
-function findCode(input: string[], codeLength: number) {
+function findCode(input: string, codeLength: number) {
   let i = 0;
   let found;
   while (!found) {
-    if (new Set(input.slice(i, i + codeLength)).size === codeLength) {
+    if (new Set(input.substring(i, i + codeLength)).size === codeLength) {
       found = i;
     }
     i++;
   }
 
   return found + codeLength;
 }

[aishwarya-mali]

No you don't even need the spread operator!

Ohh yes I thought it in context with split('') to get array.

[doleraj]

That makes sense to me. I always assume string stuff is going to be slower than raw arrays.

[bogdaaamn]

Nice as ush! Almost the same, but I went for for-loops

[turingtestable]

Here's my: Ruby Solution. I did the naive solution first, and then fixed it, feel free to check out the previous commit. This seems like a way easier challenge than the past few days.

[tkshill]

Excellent

[davidalpert]

here's my F# solution

• Tuning Trouble

I made deliberate choices about when I used Seq (which is somewhat lazy and often iterates on demand) and Array to avoid dealing with the latter parts of the string and bail out of the loop as soon as we found a match.

[tkshill]

I am so jealous of this solution. Lovely! I totally forgot about windowed

[tkshill]

I'm thinking you might have been able to use Seq.indexed here (if you preferred) and maybe streamline some of the index stuff

Something like?

buffer.Trim().ToCharArray()
            |> Seq.windowed n
            |> Seq.indexed
            |> Seq.find (fun value -> snd value |> window |> Array.distinct |> Array.length = n)
            |> fst
            |> ((+) 1)

[aishwarya-mali]

JS: https://github.com/aishwarya-mali/advent-of-code/blob/main/2022/Day-6/script.js

[danieltott]

OMG this is awesome! I had no idea you could feed a string to Set and it would use the individual parts!

[tkshill]

So elegant!

[bogdaaamn]

Amazing! Clean and short, I love it. I also went for a Set and it didn't disappoint

[tkshill]

I'm genuinely pissed at how straightforward this was compared to 5

Solution using RECURSION

[clandau]

I'm happy. I can focus on work today 😆

[bogdaaamn]

NICE, I started with recursion as well. But I dropped it for my own sanity and went classic

[danimeyer]

Ruby: https://github.com/danimeyer/advent-of-code/blob/main/2022/6.rb

I also refactored, but you can find my original solution here. It's ugly 😂

[Cerchie]

finished part 1, will pick up part 2 tomorrow! https://github.com/Cerchie/adventofcode2022/tree/main/day-06

[tkshill]

letterBeforeBefore and letterAfterAfter are my new favourite variable names

[bogdaaamn]

ahahaha amazing

[bogdaaamn]

Late to the game but here we gooo https://github.com/BogDAAAMN/advent-of-code-2022/blob/main/day-06.js

I don't like too much the for i++ loop solution, but I think I dislike more while(found), so here we go 😂

But I am proud of myself for reminding Sets exist 😂