|
akadajet posted:it’s almost time yeah, time to pretend leetchode is fun and interesting
|
# ? Nov 22, 2023 23:56 |
|
|
# ? Jun 7, 2024 10:59 |
|
akadajet posted:it’s almost time https://twitter.com/ericwastl/status/1728651939653538074 https://twitter.com/ericwastl/status/1728654506764710172
|
# ? Nov 26, 2023 16:22 |
|
DrPossum posted:more like advent of chode
|
# ? Nov 26, 2023 18:43 |
|
less than 24h! I just love this event so much. Can’t wait to see the ridiculous saving Christmas scenario Wastl has come up with this year.
|
# ? Nov 30, 2023 18:16 |
|
MrQueasy posted:less than 24h! and the crowd chants.... chode! chode! chode! chode!
|
# ? Nov 30, 2023 18:18 |
|
akadajet posted:and the crowd chants.... oh poo poo! sorry (turns around and an exaggerated zipper sfx plays)
|
# ? Nov 30, 2023 18:35 |
|
DrPossum posted:more like advent of chode
|
# ? Nov 30, 2023 19:01 |
|
DrPossum posted:more like advent of chode
|
# ? Nov 30, 2023 19:09 |
|
can't wait for someone to try and do all the challenges with chatgpt
|
# ? Nov 30, 2023 19:31 |
|
Armitag3 posted:can't wait for someone to try and do all the challenges with chatgpt That happened last year. The site is asking people not to take up leaderboard positions with AI solvers this year.
|
# ? Nov 30, 2023 19:33 |
|
MrQueasy posted:That happened last year. The site is asking people not to take up leaderboard positions with AI solvers this year. like I said...
|
# ? Nov 30, 2023 19:35 |
|
the leaderboards are nonsense. and i don't say that just because i am not getting up for 6am this year.
|
# ? Nov 30, 2023 19:51 |
|
I'm gonna try it in Rust this year, so that I can clear some cobwebs off of my resume and learn something new
|
# ? Nov 30, 2023 20:12 |
|
i'm going *explicitly* least-resistence this year. don't have that much time to spend but intend to get it all done, so no time to get fancy.
|
# ? Nov 30, 2023 20:17 |
|
Cybernetic Vermin posted:i'm going *explicitly* least-resistence this year. don't have that much time to spend but intend to get it all done, so no time to get fancy. my favorite part is that once the problems are out, they stay up and you can still submit an answer years later.
|
# ? Dec 1, 2023 02:53 |
|
third place in our leaderboard on day 1! Second part threw me for a loop.
|
# ? Dec 1, 2023 06:50 |
|
surprisingly tricky for a day 1 yeah, e.g. not quite pure primitives given overlaps can trip things up. personally i don't care for doing them years later, i plan to attempt to keep strict same-day-solve. but being fairly busy this december that'll probably be difficult enough without learning much new.
|
# ? Dec 1, 2023 07:15 |
|
twone
|
# ? Dec 1, 2023 17:56 |
|
josh2112 posted:twone
|
# ? Dec 1, 2023 19:35 |
|
I tried to get a private leaderboard going at my work and I think everyone else gave up when they saw part 2.
|
# ? Dec 1, 2023 20:23 |
|
Hed posted:I tried to get a private leaderboard going at my work and I think everyone else gave up when they saw part 2. i rather liked it for my own enjoyment, but i had exactly that thought "wow, real early for a short of tedious parsing exercise" for most people
|
# ? Dec 1, 2023 20:26 |
|
day 1 has usually been a parsing or straightforward math problem part 2 was surprisingly difficult imo because it was difficult to debug, not necessarily because what was needed was overly tricky
|
# ? Dec 1, 2023 22:59 |
|
MrQueasy posted:day 1 has usually been a parsing or straightforward math problem as noted i think the issue is that most would reach for the primitives provided by their standard library, and be a bit flummoxed by "returns an iterator providing the *non-overlapping* matches". it is for sure a bit more steep than the last few years. which is not necessarily bad. but it is new for day 1 i think.
|
# ? Dec 1, 2023 23:02 |
|
akadajet posted:has anyone said “advent of chode” yet?
|
# ? Dec 1, 2023 23:27 |
|
gently caress you
|
# ? Dec 1, 2023 23:30 |
|
MrQueasy posted:day 1 has usually been a parsing or straightforward math problem it was especially tedious to debug I think because the example data didn't have hard cases
|
# ? Dec 1, 2023 23:41 |
|
Pinterest Mom posted:it was especially tedious to debug I think because the example data didn't have hard cases all my tests pass but there's still something wrong with my part two solution. I'm sure it's something dumb but I've been combing through my debug output for a while trying to find a line that's being parsed incorrectly this puzzle feels specifically like it's meant to be tricky for chatgpt do solve directly given all the trouble it has with prompts like "how many times does the letter p appear in the word prompt?" e: sorted it. it was several dumb things Asleep Style fucked around with this message at 01:26 on Dec 2, 2023 |
# ? Dec 2, 2023 01:11 |
|
enjoyed remembering how haskell worked for the first time in 11 months, and also making it nice and succinct. fits neatly into a standard terminal windowcode:
|
# ? Dec 2, 2023 01:14 |
|
Cybernetic Vermin posted:as noted i think the issue is that most would reach for the primitives provided by their standard library, and be a bit flummoxed by "returns an iterator providing the *non-overlapping* matches". it is for sure a bit more steep than the last few years. Most good languages have a find-last in their stdlib these days.
|
# ? Dec 2, 2023 01:15 |
|
MrQueasy posted:Most good languages have a find-last in their stdlib these days. I'm also stuck on Day 2, all my tests pass, I get the expected result from the example, but my final answer is wrong. I've checked the first ~100 lines and they're all correct... ...oh, maybe it does, and thats why my answer is wrong. doh. toiletbrush fucked around with this message at 02:18 on Dec 2, 2023 |
# ? Dec 2, 2023 02:14 |
|
toiletbrush posted:Find last doesn't work for Day 2, though. It does with a regex? \d|one|two|three|four|five|six|seven|eight|nine DIFFERENT HINT: search your puzzle for oneeight, sevenine, fiveight, twone BIGGER HINT: 1oneight => 18, oneight1 => 11 MrQueasy fucked around with this message at 02:20 on Dec 2, 2023 |
# ? Dec 2, 2023 02:16 |
|
MrQueasy posted:It does with a regex? \d|one|two|three|four|five|six|seven|eight|nine szsvltgsc1onecccbfour3oneightfh Should the answer be 11 or 18? I assumed it was the first, because one of the examples says zoneight234 should give 14 Edit: cool, thanks...it should be 18. I wish they'd made one of the examples make it explicit. toiletbrush fucked around with this message at 02:24 on Dec 2, 2023 |
# ? Dec 2, 2023 02:21 |
|
toiletbrush posted:So the line I'm stuck on is... 18. if you have a line that's *just* xxoneightxx, that also parses as 18 because both "one" and "eight" count there.
|
# ? Dec 2, 2023 02:23 |
|
MrQueasy posted:Most good languages have a find-last in their stdlib these days.
|
# ? Dec 2, 2023 02:48 |
|
well now i have a better understanding of how to work with regex in typescript
|
# ? Dec 2, 2023 03:36 |
|
Archduke Frantz Fanon posted:well now i have a better understanding of how to work with regex in typescript I am truly sorry for your lots. I couldn't figure out where find-last lives in the kotlin stdlib so I just ran find-first starting from each index of the string because each one was pretty short, and there weren't many lines
|
# ? Dec 2, 2023 03:50 |
|
im not doing advent of code but instead of running a bunch of find-firsts i'd reverse the string and use find-first on eno, owt, etc. "why would you do that, achmed?" you ask. "that's deranged" "because you can't stop me"
|
# ? Dec 2, 2023 04:02 |
|
Achmed Jones posted:im not doing advent of code but instead of running a bunch of find-firsts i'd reverse the string and use find-first on eno, owt, etc. Solving things this way is very satisfying and advent of code often gives me the opportunity
|
# ? Dec 2, 2023 04:20 |
|
Achmed Jones posted:im not doing advent of code but instead of running a bunch of find-firsts i'd reverse the string and use find-first on eno, owt, etc. i asked copilot chat to solve part 2 and it did this but without reversing the searched strings
|
# ? Dec 2, 2023 05:08 |
|
|
# ? Jun 7, 2024 10:59 |
|
you could also tailrec backwards splitting the string into beginning/end and just look for the end to start with a match
|
# ? Dec 2, 2023 05:28 |