awesome VS javascript-algorithms

In the days before "google it" was a synonym for "find it", we had different curated link sites, and even pyhsical magazines with hand-curated lists of links that people interested in a certain topic might find interesting. This still exists today in some forms, for example the "awesome lists" that you see for some programming topics, for example https://github.com/sindresorhus/awesome .

Just like there was a time when 90%-99% of all email traffic was viagra spam, I imagine in the future most of the internet by volume will be AI-generated trash, and those in the know will still circulate lists of where the other 1% can be found.

An even brighter scenario is that someone, maybe a kid tinkering in their garage, figures out how to make a search engine that finds the good stuff, doesn't immediately die to AI bot farms' SEO efforts, and is financially viable.

2. Awesome Lists

Software Engineering Blogs

He appears to be the original creator of the “Awesome X” repo: https://github.com/sindresorhus/awesome

Awesome React

I'm just going to leave this here: awesome git repo

You don't need any particular requirement to consult issues section on GitHub. If you need a place to follow along this post, my chosen repository for today's blog post is Awesome.

I have an awesome list GitHub repository that needs a few icons & a banner made. I was wondering if any students in graphic design would be willing to commission a few for me? I'm willing to pay either hourly, or by the project and can pay cash or venmo. Note that the art will end up as CC0, so you'd essentially be waiving any right to the artwork.

yah, come to think of it in the curated space, this reminds me of that awesome X family of github pages. Looks like someone compiled a bunch of them here https://github.com/sindresorhus/awesome#databases. I have found those to be highly valuable treasure troves pregnant with rich and relevant information.

10. Awesome

I'm reminded of the time when some kid wrote a script to crawl GitHub and create issues[1] about using inclusive language... except it was really dumb, for example: https://github.com/trekhleb/javascript-algorithms/pull/875/f...

[1] E.g.: https://github.com/EbookFoundation/free-programming-books/pu...

Try codewars or leetcode Or you can use this repo for ds practice https://github.com/trekhleb/javascript-algorithms

This one is pretty popular too.

for algos - not sure how much you'll need to do for a jr position but familiarity with some of the beginner stuff here couldn't hurt: https://github.com/trekhleb/javascript-algorithms

Traditionally, a linked list allows you to insert before/after a node. i.e. addBefore(node,value) (see [2] ) He doesn't implement addBefore & addAfter.

Instead, he provides a whole bunch of non-canonical helpers like reverse(), toArray(), deleteTail() etc - these are typical LC-Easy problems that don't belong inside the data structure.

My own introduction to these things was a C course called "Data Structures in C" in the traditional CS curriculum, and yes, you would have to malloc a new node, get back a pointer with a memory address, & the process of pointing the next pointer of the current node to this new node so that the memory address of the next value was explicitly "linked" to the current value and hence linked list etc...I guess much of that terminology is lost on the new generation in the absence of pointers & memory addresses.

The canonical exercise in those days was - Show that a linked list does not store objects in contiguous memory, unlike an array. So to solve this, you would traverse the list from the head node & print the actual addresses of the memory locations along the way, proving that the vals aren't stored contiguously. I wonder what that exercise would mean in JS land.

That said, yeah its a good starting point & I applaud the effort.

[1]https://github.com/trekhleb/javascript-algorithms/blob/maste...

You could also check out: 1. 30 seconds of code 2. JavaScript30 3. JavaScript Algorithms