This Algorithm is 1,606,240% FASTER

7 Steps it took to make an algorithm 1,606,242% faster!!!!

Become a backend engineer. Its my favorite site

This is also the best way to support me is to support yourself becoming a better backend engineer.

### David Perez

### B3NNY

### Bit video

### Code used in video

### Twitch
Everything is built live on twitch
### Editor

Join this channel to get access to perks:

### Links

#coding #neovim #typescript #programming #vim #softwareengineering #codinglife #webdesign #webdevelopment #webdev #javascript #rustlang #rust #twitch #twitchstreamer #programmerhumor #codinghumor #software #softwareengineer #softwaredeveloper #softwaredevelopment

[e]

Exactly. It's not about Rust vs C vs Cpp vs Zig.
It's about how much you understand system programming.

[slurpe_ee]

as a beginner developer, seeing you go from an array to bit manipulation was like watching black magic. incredible to see what we can do with these technologies and break them down to their atomic pieces.

[DrOptix]

This is really awesome because you don't just show the final kick ass solution, but also present a mental model on how to get from the naive solution to the fast one.

[fishfpv]

Really like videos going over practical algerithm optimization. I feel in school there is a lot of focus on theory and very little on how to make things run fast in the real world. Love to see more of these types of videos!

[aleclowry]

“Binary ten thousand” is a phrase that makes be very uncomfortable. Lol

[yungclowns]

In the (relatively common) case where there's a 14-character window with more than one duplicate, going backwards within the window allows you to find the duplicate furthest along in the input. This means you can skip ahead further in those cases. It is a good example of a 'greedy' optimization looking for the best case (a late duplicate) first.

[radialorbits]

Benny's solution with bin manip was great. Slicing and jumping forward, rather than step by step is brilliant

[ThePrimeagen]

Tell me you were surprised by using a vector to speed up instead of using a hashset but telling me i am beautiful (and liking the video)

Slight correction.
When I say left shift is multiplied by 10, I meant 10 in binary. Therefore it is two in decimal

[brendanwenzel]

More of this is needed! I never knew I needed to know this stuff. Best part of YouTube is getting mentored by a senior dev without having to be in the same office!

[BreakbeatNightmare]

More videos like this please! Love the deep dive into blazingly fast computer science topics

[sxlg_]

Love this content. Really cool and even though I haven't looked at some of the concepts for a while, i can tell you've got fundamental knowledge to bank on. Can't wait to see more!

[daltonyon]

Amazing, I really love this type of content and inspire me to always thinking about performance

[alexandersemionov]

I just had my imposter syndrome gone, and then I watched this video. Damn it!
Great video, a lot of small details and bits of information. Being a nerd is a lot of fun. Thanks ;)

[PanduPoluan]

And a note of caution: Although yes the performance increases significantly, the more optimised it becomes, the more specialised and hard to maintain it will also be.

For the purposes of the Advent of Code challenge, it's perfectly suitable.

However for daily development, the tradeoffs need to be considered really carefully.

Finally, before going down the rabbit hole of extreme optimisation, don't forget to *profile your code first* ! You don't want to spend an inordinate amount of time hyper-optimizing a portion of your code that only affects 1% of total execution time. Find pieces of code that affects 10% or more of execution time and focus your efforts there first.

[ryandevenney]

Long time fan and this is my favorite video I’ve seen from you, more of this please!!

[Green__]

This is the kind of breakdown I’ve been looking for!! Thank you and your family for this content 😅

[Nintron]

This deep dive into optimization was fantastic! Keep up the great content Prime.

[darkfire]

Nice explanation! I pretty much went for full speed with no regards for readability / maintainability with this AoC (using rust ofc lol). I managed to get my day 6 solution down to about 4 microseconds on one of the discord callenge bots and I had a rather similar approach to you. The performance on the bot was a bit flakey, but some guy had it down to 2us on the bot which was what I got locally on my ryzen 7 2700x

[jonathangodar]

Loved the format of this video, it was explained so nicely and very easy to follow! Ty

[reyariass]

This is the type of videos I look for, where they scratch the surface good algorithms, give examples with actual code, and share similar ones. Amazing!