wtfjs
javascript-algorithms
Our great sponsors
wtfjs | javascript-algorithms | |
---|---|---|
94 | 118 | |
33,999 | 182,565 | |
- | - | |
0.0 | 5.3 | |
5 months ago | 7 days ago | |
JavaScript | JavaScript | |
Do What The F*ck You Want To Public License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
wtfjs
- Milyen hasznos Github repokat ismertek?
- doNotDespairEverythingIsAhead
-
Companies: We can't find any good candidates!!! Also companies:
Me in the interview: "Generally, no, a variable can only be assigned one numeric value at a time. However, Javascript is famous for unpredictable behaviors in variable comparison statements, for instance [] == ![]. There's actually a whole library built around documenting this type of behavior this for comedic value, and other more serious libraries geared towards solving the problem. So it's possible that some obscure variable assignment scenario would result in that line evaluating as true, but it's not something you'd expect to encounter in the real world. This has gotten a lot better with typescript and es2022, but still something you need to watch for a bit."
-
“Go is hard to justify unless at massive scale”
I do see that point of view, didn't think of that, there are some aspects of go which are a bit weird if you never touched lower abstraction languages, yet once you learn what they are, you are all set and you can code in anything. go has the least amount of gotchas I have seen in any programming language. compare it with loads of the weird stuff javascript does https://github.com/denysdovhan/wtfjs and go is like heavenly lol
- Typescript is polishing a turd
- 3 < 2 < 1 === true
- Show HN: Whatdoesthiscodedo.com – AI explanations for other people’s code
-
Learning Frontend/React is the new rat race.
Its a very poorly designed language. Its syntax and semantics are often confusing and unpredictable. There is no well defined mental model of how constructs work in this language.
-
🚀 8 GitHub Repositories to learn JavaScript
WTF JS
-
Awesome Github Repos to Master JAVASCRIPT
😎 A great guide to Javascript that is both simple and wonderful, but also difficult and fun that seems like bullshit. -> wtfjs
javascript-algorithms
- 10 GitHub Repos for Mastering JavaScript
-
Minecraft Grub Theme
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...
-
is there any website that you can practise javascript from complete beginning to mastery
Try codewars or leetcode Or you can use this repo for ds practice https://github.com/trekhleb/javascript-algorithms
-
Is anyone interested in contributing to Ultimate Guide to Algorithm opensource together?
This one is pretty popular too.
-
Help! Prep for interview in 2 weeks
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
-
JavaScript-algorithms: Algorithms and data structures implemented in JavaScript
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...
- 30 March 2023 - Daily Chat Thread
What are some alternatives?
Power-Fx - Power Fx low-code programming language
Dlib - A toolkit for making real world machine learning and data analysis applications in C++
jsfuck - Write any JavaScript with 6 Characters: []()!+
javascript-es2020-sandbox - This is a place for me to screw around some code and will be the home of my future JavaScript ES2020 Cheat Sheet
html-over-the-wire - HTML over the wire: List of frameworks which receive HTML snippets from the server.
developer-roadmap - Interactive roadmaps, guides and other educational content to help developers grow in their careers.
wtfpython - What the f*ck Python? 😱
clean-code-javascript - :bathtub: Clean Code concepts adapted for JavaScript
proposal-shadowrealm - ECMAScript Proposal, specs, and reference implementation for Realms
free-for-dev - A list of SaaS, PaaS and IaaS offerings that have free tiers of interest to devops and infradev
typegoose - Typegoose - Define Mongoose models using TypeScript classes.
You-Dont-Know-JS - A book series on JavaScript. @YDKJS on twitter.