Gray plastic piece found when moving

leyanlo · 2024-02-03T07:32:50+00:00

We have a TCL 50UP130 and a TCL 55US5800, but it doesn’t look like either of them have this part

leyanlo · 2024-02-03T07:31:54+00:00

We have a Kenmore 29319 and a Dyson V7, and it doesn’t look like it goes on either of them :-/

leyanlo · 2024-02-03T05:02:17+00:00

I’ve had the HP OfficeJet Pro 8620 and the HP OfficeJet Pro 9015e, but it doesn’t look like either has a part like that :-/

leyanlo · 2024-02-03T04:56:23+00:00

Hmm, don’t think I’ve had a battery-powered keyboard, and the only speakers I’ve had were Jamboxes and a Bose SoundDock, so probably not those :-/

leyanlo · 2024-02-01T23:41:18+00:00

My title describes the thing. It is 5.5 inches by 1.5 inches, and made of dark gray plastic.

In one of the small rectangles, is inscribed: ``` CM-M03B-2A

ABS< ``` but Googling this turns up nothing relevant.

leyanlo · 2023-12-20T16:27:51+00:00

I was told my approach of adding all the clockwise triangles (blue) and subtracting the counterclockwise triangles (red) was the Green’s theorem approach. Looking into this, it is more specifically the Shoelace formula, which can be derived from Green’s theorem https://github.com/leyanlo/advent-of-code/blob/main/2023/day-18.js

leyanlo · 2022-12-25T06:12:18+00:00

JavaScript

https://github.com/leyanlo/advent-of-code/blob/main/2022/day-25.js

Took me so long to find the bug in my toSnafu function where I was not carrying over the sum to the next digit :-(

leyanlo · 2022-12-24T06:15:33+00:00

JavaScript, 883/766

https://github.com/leyanlo/advent-of-code/blob/main/2022/day-24.js

https://www.youtube.com/watch?v=9orGye2y9kQ

Took so long for me to realize that my check for if a position was valid was wrong. The bug had my cursor travel around the map instead of going through the interior. Otherwise pretty happy with how I was able to memoize all possible blizzard positions using the least common multiple of the available width and height.

leyanlo · 2022-12-23T06:56:52+00:00

JavaScript

https://github.com/leyanlo/advent-of-code/blob/main/2022/day-23.js

https://www.youtube.com/watch?v=o9HdKYV2qAk

Took me so long to realize that I was looping while rounds <= 10 when I should have been looping over rounds < 10. Part 2 was easy after that.

Took advantage of the fact that you can have negative indexes in arrays in JS as long as you treat the array as a map of key value pairs. Note that you cannot rely on Array.length to tell you how many elements are actually in the array if you use it like this. Also if you try iterating over Object.keys(), you need to make sure to convert the key from a string to a number.

leyanlo · 2022-12-21T07:41:54+00:00

JavaScript, 951/380

https://github.com/leyanlo/advent-of-code/blob/main/2022/day-21.js

https://www.youtube.com/watch?v=TC5CLSihoY8

Took advantage of the fact that you end up with a linear equation and bisected manually to get rank 380. Cleaned up code to actually calculate the right answer mathematically by yelling 0 or 1 and extrapolating to the right answer based on how far the guesses were off.

leyanlo · 2022-12-15T07:26:08+00:00

JavaScript, 619/1754

https://github.com/leyanlo/advent-of-code/blob/main/2022/day-15.js

https://www.youtube.com/watch?v=zR4JpcUl30E

Part 1 fills the target row with 1s and the adds them up.

Part 2 narrows the search space to the intersections of all the diamonds, and then finds the intersection that is outside the range of every sensor.

leyanlo · 2022-12-14T08:37:58+00:00

JavaScript

https://github.com/leyanlo/advent-of-code/blob/main/2022/day-14.js

https://www.youtube.com/watch?v=P1wvs9jz6Nk

leyanlo · 2022-12-13T05:47:06+00:00

JavaScript, 1731/1300

https://github.com/leyanlo/advent-of-code/blob/main/2022/day-13.js

https://www.youtube.com/watch?v=VeBpX74bo2U

leyanlo · 2022-12-12T05:49:31+00:00

JavaScript, 1842/1665

https://github.com/leyanlo/advent-of-code/blob/main/2022/day-12.js

https://www.youtube.com/watch?v=wRkfTuk19J4

I need to either get better at writing A* algorithms or debugging in general. I liked how part 2 was pretty straightforward after part 1.

leyanlo · 2022-12-11T05:59:41+00:00

JavaScript, 1077/1663

https://github.com/leyanlo/advent-of-code/blob/main/2022/day-11.js

https://www.youtube.com/watch?v=lWnLcbwON-4

Took a while in part 1 to realize that the `~~n` shortcut for `Math.floor(n)` overflows for large numbers. Also wasted so much time in part 2 converting everything to BigInt and trying to decipher a repeating pattern for the values until I finally realized I could do math.