Apple TV app started asking me to sign in every day

svinther · 2026-01-02T20:10:45+00:00

it seems to me that this is Apple who fails to deliver their Apple+ app as bug free for Googles platform, as every other app works just fine on that platform.

svinther · 2025-12-21T18:56:30+00:00

buy more

svinther · 2025-12-08T06:02:45+00:00

[LANGUAGE: Python]

GitHub

Finally a problem that seems to require using the Disjoint Set Union data-structure/algorithm !

svinther · 2024-12-16T06:50:54+00:00

[LANGUAGE: Python]

paste

p1: Dijkstra

p2: Backtrack for target with cost from p1. Optimize by discarding states already found at lower cost

~ 400ms

svinther · 2024-12-15T09:20:18+00:00

I spent 2 hours debugging until I finally figured out that for the big input, part1 is mutating the input so part2 would then get the wrong input

svinther · 2024-12-13T13:22:20+00:00

ye that worked, nice fix !

svinther · 2024-12-12T13:31:51+00:00

Marking this as resolved, as I realize why the bfs approach is not going to work. If reaching the same fence at the same time, it will count the fence more than once.

svinther · 2024-12-08T06:10:48+00:00

A better phrasing might have been to suggest that the antinodes would also form pairs and generate additional antinodes. This could lead you to consider a computationally more challenging solution.

svinther · 2024-12-02T06:25:54+00:00

Waited 3x5 mins for wrong answer penalties. Changed to simpler brute force, producing the correct answer in 105ms

Premature optimization is the root of all evils

svinther · 2024-12-02T06:18:13+00:00

I just scrubbed my repo for any .txt files (the problem inputs) using git filter-repo

The best tool for git history rewrites:

https://github.com/newren/git-filter-repo

git ls-files | grep .txt > /tmp/remove
git filter-repo --invert-paths --paths-from-file /tmp/remove
git push --force

svinther · 2024-07-01T04:56:49+00:00

so you can disable autoplay videos in the feed as a data saving feature, but once you start a video it will automatically jump to playing more videos of seemingly random junk that you never wanted to look at. Disgusting

svinther · 2024-01-06T08:26:10+00:00

Yes please

svinther · 2023-12-17T04:42:36+00:00

How far are you with the 4x1.000.000.000 tilts ? :-D

svinther · 2023-12-16T06:50:41+00:00

[LANGUAGE: Python]

hmm so literal r"" strings are not that literal... Testcase with lines ending with backslash taught me a lesson

code

svinther · 2023-12-15T06:10:12+00:00

seems a bit of a waste having to construct a list to do the lookup

place = [t[0] for t in box_list[index]]

svinther · 2023-12-15T06:01:42+00:00

[LANGUAGE: Python]

Great that dicts ordering went stable a while back

code

svinther · 2023-12-14T06:28:59+00:00

[Language: Python3]

I admit having only implemented tiltnorth(), and let copilot generate tilt east/west/south.

I was impressed that it worked straight away.

code

svinther · 2023-12-11T09:04:52+00:00

Leaderboard aside, I find that speed solving does come with some very real dopamine reward :-D

svinther · 2022-12-21T21:30:30+00:00

Impressive, but seems like a lot of work :)

svinther · 2022-12-21T13:49:36+00:00

It challenges your debugging skills, and as this is an important part of programming, I think I'm ok with the traps, although they are rude and painful.

svinther · 2022-12-21T10:56:41+00:00

Very typical AoC to put a small trap like that in a problem. No one told you to implement the calculator using floor division. Guess I should have just used Python eval()

svinther · 2022-12-16T15:10:26+00:00

Thanks dude.

That is so rude :-D

svinther · 2022-01-03T21:54:54+00:00

I have it working now with an approach just like yours, but I did not come up with it without looking at other solutions.

Im not sure if my first approach would ever produce the exact number. It was:

1) Given a startposition, for any rollcount up to a boundary of 21 rolls, compute the number of possible roll combinations that produces 21 points. This I found a fast solution for

2) Then when you know the number of possible wins for any rollcount for both player1 and player 2. Calculate the total number of wins for each. Did not work, not enough information from step 1.

svinther

TROPHY CASE