ideapad-320 wrote:

applejuiceproduc wrote:

ideapad-320 wrote:

applejuiceproduc wrote:

Day 1 - Discussion

I cant post my solution yet, I will post it tomorrow, but it contains an if statement that runs 180 million times just to get the answer.

Why?
Also, I will not be posting my solutions here to not dox myself.

I can now because the day is over so here it is:

# Sorts list from highest to lowest
def sort_from_lowest_to_highest(list):
    sorted_list = []
    iteration = 10000
    while iteration != 99999:
        for item in list:
            if item == iteration:
                sorted_list.append(item)
        iteration = iteration + 1
    return sorted_list

It says “Sorry, this post appears to include unsuitable language and will not be posted.” when I try to post the whole thing, so I'm just posting the function where it sorts the list from lowest to highest in a very silly way.

The if statement is the one that runs 170 million times in each run. I know that function is coded very stupidly, but I thought “that will technically work” so I decided to do it.

My advice: just use the built-in sort function. It is a lot simpler and faster. For your filterbot issue, put it out of a code block.

mybearworld wrote:

Day 2 - Dicussion

I tried to not just use a loop for the second part, which ended up taking me several hours just for me to keep finding another bug. I conceded and just used a loop after that

(Also, I'm putting all my solutions on GitHub at https://github.com/mybearworld/advent2024)

ideapad-320 wrote:

(#22)
Day 2 - Dicussion
Yeah, me too. I got an undercount. I also ended up with a brute-force loop (with early exit when valid, of course).
If it is valid without the dampener, it is valid with the first or last removed, I didn't check for the case of nothing removed. Did you?

ninjaMAR wrote:

Day 3:
https://xkcd.com/208/

applejuiceproduc wrote:

Day 3 - Discussion

I got both parts first try, but it took me about an hour to do them. I had never used regular expressions before, and I ended up using 8 of them. I had 113 lines of code in my second part, because I decided to parse all the characters one by one in dozens of if statements.

gilbert_given_189 wrote:

ninjaMAR wrote:

Day 3:
https://xkcd.com/208/

Bonus points if you can do the day with a single expression.

ideapad-320 wrote:

(#29)
How???

/* this is a spoiler tag, scroll right to see it                                                                                                                           */ /(mul|do|don't)\((?:(\d{1,3}),(\d{1,3}))?\)/g

mybearworld wrote:

ideapad-320 wrote:

(#29)
How???

Something like this can do (it's what I actually did), where you then have to check for the actual names of the functions when handling the matches.

/* this is a spoiler tag, scroll right to see it                                                                                                                           */ /(mul|do|don't)\((?:(\d{1,3}),(\d{1,3}))?\)/g

ideapad-320 wrote:

(#29)

gilbert_given_189 wrote:

ninjaMAR wrote:

Day 3:
https://xkcd.com/208/

Bonus points if you can do the day with a single expression.

How???

Spoiler -> Scroll Right:                                                                                                                             mul\(\d*,\d*\)|do\(\)|don't\(\)

mybearworld wrote:

Day 4 - Discussion

Part 2 felt way easier than part 1 for me. Fewer lines of code, too.

ideapad-320 wrote:

applejuiceproduc wrote:

Day 3 - Discussion

I got both parts first try, but it took me about an hour to do them. I had never used regular expressions before, and I ended up using 8 of them. I had 113 lines of code in my second part, because I decided to parse all the characters one by one in dozens of if statements.

What regexs did you use?

[\d]

mul\([\d]+
mul\([\d]+,
mul\([\d]+,[\d]+

applejuiceproduc wrote:

ideapad-320 wrote:

applejuiceproduc wrote:

Day 3 - Discussion

I got both parts first try, but it took me about an hour to do them. I had never used regular expressions before, and I ended up using 8 of them. I had 113 lines of code in my second part, because I decided to parse all the characters one by one in dozens of if statements.

What regexs did you use?

I coded it so that it would go through each letter and if it found the possible start of a function it would start reading it. So the regexs are:
five of

[\d]

Four to detect if the current character is a number and one to look for the numbers when trying to multiply the 2 parts together.
The rest were:

mul\([\d]+
mul\([\d]+,
mul\([\d]+,[\d]+

Which were used to check what was in the current string where I recorded the progress towards getting a valid mul() function.

ideapad-320 wrote:

mybearworld wrote:

Day 4 - Discussion

Part 2 felt way easier than part 1 for me. Fewer lines of code, too.

What did you do for part 1? I used 2 for loops, one for the x direction, one for the y direction.

bGluZXMgPSBbXQoKd2hpbGUgKGkgOj0gaW5wdXQoKSkgIT0gJyc6CiAgICBsaW5lcy5hcHBlbmQoJy4uLi4uJyArIGkgKyAnLi4uLi4nKQoKbCA9IGxlbihsaW5lc1swXSkKZm9yIGkgaW4gcmFuZ2UoNSk6CiAgICBsaW5lcy5hcHBlbmQoJy4nICogbCkKICAgIGxpbmVzLmluc2VydCgwLCAnLicgKiBsKQoKcyA9IDAKdCA9IDAKICAgIApkZWYgY2hlY2soYXJyYXksIHgsIHkpOgogICAgI3ByaW50KHgsIHkpCiAgICBidWlsdF9zdHJpbmdzID0gWycnXSoyCiAgICBmb3IgaSBpbiByYW5nZSgzKToKICAgICAgICBidWlsdF9zdHJpbmdzWzBdICs9IGFycmF5W3kraV1beCtpXQogICAgICAgIGJ1aWx0X3N0cmluZ3NbMV0gKz0gYXJyYXlbeStpXVsoeCsyKS1pXQogICAgI3ByaW50KGJ1aWx0X3N0cmluZ3MpCiAgICBpZiAoYnVpbHRfc3RyaW5nc1swXSA9PSAnTUFTJyBvciBidWlsdF9zdHJpbmdzWzBdID09ICdTQU0nKSBhbmQgKGJ1aWx0X3N0cmluZ3NbMV0gPT0gJ01BUycgb3IgYnVpbHRfc3RyaW5nc1sxXSA9PSAnU0FNJyk6CiAgICAgICAgcmV0dXJuIDEKICAgIHJldHVybiAwCgpmb3IgeCBpbiByYW5nZShsZW4obGluZXNbMF0pIC0gMTApOgogICAgZm9yIHkgaW4gcmFuZ2UobGVuKGxpbmVzKSAtIDEwKToKICAgICAgICBzICs9IGNoZWNrKGxpbmVzLCB4KzUsIHkrNSkK