awesome-nestjs VS javascript-algorithms

check this repo you might find something there => https://github.com/nestjs/awesome-nestjs

I worked full stack with .net and angular for a year. I would say that is you think too OOP, you might try to do things that typescript doesn't do well. Like extending one class with multiple base clases. I've been working with Nestjs for one year or so in a personal project and I think it's amazing. You can do simple things like MVC and rest apis with little efforts. You can also work with more complex patterns like DDD and event sourcing pretty much out of the box. Because it is also JavaScript and node you can use a plethora of packages that solve your problems similarly as .net like Automapper, typeorm/mikroorm (entity framework like). In addition to a ton of open source projects that are using nestjs. Check https://github.com/nestjs/awesome-nestjs so you can explore how to get started. I would recommend you to use NX.dev to work your mono repo, it is super powerful and easy to maintain a full node mono repo. And it even has a plug in to add c# .net core projects as well https://github.com/nx-dotnet/nx-dotnet. So you can still leverage on the same tech you already know for more complex things like Identity server.

You can find here

Possibly one of the boilerplates on awesome-nestjs?

I use Nest.js for backend development, here's a repository with many resources regarding nest, it also includes list of real world projects using Nest.js.

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...