I find it useful, and use it almost daily. Helps answer "how to" questions for working on my house, development or just general questions. If I need more info, I just look at the links or videos which are also right there.
In web development, you mostly deal with data, sometimes you need to group that data, and some of these algos can help with that.
Most useful when you work with large datasets, if you can reduce a workload that takes hours into minutes or less, congrats, otherwise, you are forced to wait the hours. Either way, job security.
This was actually pretty cool. It's similar to crossword puzzles in how you get a hint. Maybe its too easy though, I got it in 2 attempts. I'm definitely not smart lol.
There is a bit more nuance in using `this` in a named function that wasn't covered. Named functions defined in classes are scoped outside of the class, meaning they are not bound to the class. To use `this` in your named function, you usually have to bind it in the constructor using `this.functionName.bind(this)`
Arrow functions defined within a class are scoped and bound to the class automatically. Hence, arrow functions do not require calling the .bind in constructor, and you can happily use `this` inside arrow functions.
Doesn't AI have diminishing returns on it's pseudo creativity? Throw all the training output of LLM into a circle. If all input comes from other LLM output, the circle never grows. Humans constantly step outside the circle.
Perhaps LLM can be modified to step outside the circle, but as of today, it would be akin to monkeys typing.
Yes, SQL can perform the task, but there are conflicts/performance issues in the ranking algorithm when it comes to tied rankings or pulling from X rank offset. In addition heavy writes and reads may affect performance of other queries outside of leaderboards.
I am slowly working on a gaming portal platform, and I need to be able to host endless amounts of statistic leaderboards which can be individually cut many different ways. I'm researching if its even possible to be a bit more efficient and optimized to make a leaderboard focused database.
I like leaderboards, and its a bit sad that Redis is the only optimal database for leaderboards. So, I'm attempting a drunken version of a statistic database that tracks stats and leaderboards in realtime. I guess the only major defining quality would be that in one step I can get both the sorted scores + entire row of linked user data.
For redis this is two steps: `ZRANGE leaderb 1 100` + `GET x1 x2 x3 x4 ... x100`.
It's mostly a refresher for deep C++ doodling, but maybe I'll use it in production for kicks.
I was not thinking about ordering, that is an important point. I focused mainly on finding the "row" belonging to a unique key.
Maintaining/designing the btree for innodb or postgres must be a nightmare with multithreading and the plethora of other features. I didn't want to dive into that rabbit hole.
Developers choose packages. Executives or even managers are so far removed from the process, can't expect any monetary support from those who control the money.