Видео

Incredibly smart stuff and presented straightforwardly. You're a gem.

wow, this make my brain blow.

Thank you so much for this amazing video! A bit off-topic, but I wanted to ask: I have a SafePal wallet with USDT, and I have the seed phrase. (alarm fetch churn bridge exercise tape speak race clerk couch crater letter). What's the best way to send them to Binance?

Hey man, not sure how I stumbled upon your page a while ago. Haven't watched many videos but def plan on going through them to learn how to approach boxes/challenges. I was wondering, what did you do to get to the point where you can tackle any box and challenge? Where did it start? I started with IT and not Comp Sci, so I'm slowly learning this stuff in my free time more as a hobby. Curious to hear your journey. Maybe you have a video? Thanks!

Thanks for sharing, always learn a lot watching your code sessions.

Hellloooo!

First

Think you can just do max(dict.values()) but other than that great. Waiting for your day 23 - 25 solution! happy christmas

Nice video, but there is no actual explanation of how to get modname or getattr(app). in your case you just ran a simplified app, got 3 different names and one of them magically worked. After searching online I wasn't able to find any info on how to get it.

Here is how I did part 2: I figured that Christmas Tree should have several long horizontal lines of robots, and there should be a high degree of symmetry. So I calculated a "Symmetry Score" for each time second that measured the degree of horizontal symmetry and looked for when that symmetry score spiked up.

Have really enjoyed the content for the 2024 season, looking forward to seeing how you finish the series. Have a great Holiday season.

I'd just like to comment that I have watched most of your video's of AoC '24 up until now and I really enjoy them. This is my first time participating with AoC with the goal to bring my python skills up to a usable level :) I'm not bothered with the leaderboard at all and try to solve the puzzles first by myself and in order and then watch your corresponding video to see what solutions you came up with. (At the time of this writing I'm pondering day9 part2.) Usually this means only using about 20% of the lines I needed XD. You videos are consise, you expain your train of thought well and you explain all your considerations. Greatly appreciated!

awesome

Great video. I was a little bit lost on the second part, so thanks for your explanation and solution 👍

Neat

thanks for the clear explanation, i was so stuck on this one!

Love the content 0xdf. Great inspiration.

0xdf casually flexing his quick math, great explanation!

hello sir, can you refer me at hackthebox> i really love it, i have completed cpts path and after my university examinations will be giving the cpts exam and also i have completed my ejpt certification

From Part 1, you know that you can get through with 1024 drops, so you can start with lo = 1024 for Part 2.

How can i create the .session file? the bash script is failing at that point for me: "AOC_SESSION isn't set. Cannot continue."

Hey! You should also just leave the debugging in the video. Personally, I feel that when I write code, its unreasonable to expect it to always work the first time. When I see others debugging code, I gain intuition on things that could go wrong or to watch out for. This gives important insight I would rather not miss. Love the interesting content! Cheers

Incase you are interested in why tuples were slower, it is because python expects addition to lists and keeps about a 2 thirds empty always to save on reallocation. But with tuples you were constantly remaking and recopying everything each time you added something to it.

16:01, it would have been good if you just didnt use f strings and simply wrote print("Part 2", *part2)

Nice work!

if you wanna show something with your cursor, make sure to capture it.

I agree part 2 was annoying. I misread the problem description where it said that *most* robots would form an image and looked for a state where *all* robots were connected in one big Christmas tree, DOH! What worked for me was looping until no robots overlapped, and at least one robot had eight neighbors.

Yeah this method is cool, me being thick as brick i had to create 10,000 images and then painfully going through thumbnails in the finders locate the solution lol!

Thanks, using the cramer's rule does make it much simpler. I solved it using just pure algebra and it wans't too pretty (had to deal with floating errors too)

Your method is super interesting. I think the theme of this question was to use topological sort O(V+E), but you've solved it using custom sort function O(nlogn). Nice use of the custom sort option (and the set it to 1 whenever the ordering is False). In terms of the sorting efficiency though not sure it would be efficient as it would have many 'equal' comparisons (harder to divide and conquer?)

Cool way to solve part 2! I just printed the first 10,000 iterations and scrolled through in VSCode while keeping an eye on the mini-map.

Cool: direct and to the point!

thanks for the videos:) learning alot. i made a bool for all allowed positions. for r,c in char_map["A"]: pos1 = bool(upleft(r,c) in char_map["S"] and downleft(r,c) in char_map["S"] and upright(r,c) in char_map["M"] and downright(r,c) in char_map["M"]) pos2 = bool(upleft(r,c) in char_map["S"] and downleft(r,c) in char_map["M"] and upright(r,c) in char_map["S"] and downright(r,c) in char_map["M"]) pos3 = bool(upleft(r,c) in char_map["M"] and downleft(r,c) in char_map["M"] and upright(r,c) in char_map["S"] and downright(r,c) in char_map["S"]) pos4 = bool(upleft(r,c) in char_map["M"] and downleft(r,c) in char_map["S"] and upright(r,c) in char_map["M"] and downright(r,c) in char_map["S"]) if pos1 or pos2 or pos3 or pos4: part2 += 1

That's great, do you solve it real time?

Really appreciate these walkthroughs as someone learning Python i enjoy the thought process and solutions you work through. Keep it up!

Hi New subsriber here , I am a beginner in python can i also like participate in this and i have just started to code learned all the topics but can i able to this type of advent of code in python ? What's your opinion on this.

I think it can be made more efficient if you cache number of 9 pos that can be reached at any given position. Great video thanks!

Great video thanks. just wanna point out that we can't see the mouse pointer in the video so when you address something using the mouse pointer it can be hard to follow. Other than that thanks!

Thanks you so much! Your solution using regex is SO much cleaner than mine... :D So I could learn a lot!

Thanks a lot, great explanation! Wouldn't it be possible to calculate the diffs without abs (column 8), use "1 <= abs(d) <=3" in column 9 and "all(d<0 for d in diffs)" in column 11 and "all(d>0 for d in diffs)" in column 12?

Clean and great code, but would love a bit of explanation about the thought process about the approach. Cheers

this helps me tremendeously. Thank you so much sir, please continue make such great quality videos.

Thanks again 0xdf, awesome as always. Anything else up to your sleeve apart from Advent of Code?

Instead of `target / num == target // num` to check for integer why not `target%num == 0`?

I think the order on witch you try the operands can impact how fast the program runs.

As a new programmer, you had me in the first half. In part 2, the refactoring onward is hard for me to comprehend completely. Nevertheless, thank you for taking the time to make this playlist for people like me looking for better solutions after solving or getting stuck

Why don't you participate in Advent of Cyber?

Thank you 0xdf. Highly appreciate your channel. I have watched almost all of your content, please continue placing high quality stuff. Your channel excels

Great job solving the problems, and explaining your process. :D

Brilliant. Once again. Respect!