Open Source JavaScript Algorithms - Page 3

This is a review summary project about preparing for front-end interviews that I have summarized, and the project is updated from time to time. This is not only a strategy for job interviews, but also a collection of front-end ers to examine themselves and achieve breakthroughs. I hope that through this guide, everyone can open up their own lines of Ren and Du, and go further on the road to the front. This warehouse uses a large number of diagrams to convey knowledge. The so-called picture is worth a thousand words. I hope that this kind of graphic expression will make it easier for you to remember some abstract and incomprehensible concepts. "Graphic Front End" is my subtitle to it. Interviewing is a very subjective and difficult thing. Just because you don't pass the interview doesn't mean you're unqualified, just like passing the interview doesn't mean you're qualified. As a candidate, you are usually given 45 minutes to demonstrate your skills.

The gruft library is a fast implementation of several cryptographic functions in JavaScript: MD5, SHA-1, SHA-256, Tiger/192, AES-Rijndael.

Algorithm Visualizer for IPython/Jupyter Notebook. If you use the display(TracerObject) code from where you want to see, you can use it without any special modification.

you can validate forms easily and faster, only you need to indicate wich fields will be validated through css classes

jStates is a java library for easy state machine design and implementation.It uses XML to define states and state transitions. jStates is aimed at easy integration with desktop J2SE applications, Struts, Commons Validator, Web and other J2EE technologies

natural sort / order of arrays, sorts integer, string and mixed arrays - also strings with numbers included will be ordered naturaly, natsort and natcasesort for javascript

javascript-algorithms is a repository that implements a comprehensive collection of classic data structures and algorithmic solutions in JavaScript — including sorting, searching, graph algorithms, dynamic programming, and more. It serves as a learning and reference resource for developers wanting to understand how standard algorithms can be expressed in JavaScript, bridging the gap between theoretical algorithm knowledge and practical implementation usable in web or Node.js contexts. Because algorithms are implemented in a language (JavaScript) many developers use daily, the repo becomes especially useful for students, interview-preparation candidates, or anyone wanting to learn algorithmic thinking without switching languages. The code tends to be readable, structured, and adapted to JavaScript idioms, making it easier to follow for JS developers.

Algorithms and data structures implemented in JavaScript with explanations and links to further readings

Collection of essential computer science data structures in Javascript. Plus some additional nifty datastructures coming in upcoming versions. Contains basic data structures - Node - BinaryNode - TernaryNode - Stack - Queue - Dequeue

jsGorithm is a Javascript algorithm execution viewer that can be used as an educative tool for introductory courses on programming and algorithmics, with programs written in a subset of C/C++/Javascript. It can be used for teaching and learning.

This is an automatic algorithm, which solves a minesweeper game field

ngraph.path is a JavaScript library that implements efficient pathfinding algorithms for graphs, primarily designed to compute shortest paths in weighted or unweighted networks. It provides a clean API for constructing graph models, assigning weights to edges, and querying for optimal routes between nodes, making it useful for routing, games, maps, and network optimization. The library includes several algorithm implementations such as A*, Dijkstra’s, and breadth-first search, each suited to different types of graph structure and performance needs. It can be integrated with visualization libraries like VivaGraphJS to animate or highlight computed paths in a rendered graph, enabling interactive routing features. Its data structures and algorithm choices are optimized for performance and memory efficiency, so even large meshes or road networks can be navigated interactively. With its standalone design, ngraph.path can be used in browser apps, server-side Node.js services.

Transport Framework

A very fast JavaScript library for geospatial point clustering for browsers and Node. supercluster supports property aggregation with the following two options. Map, a function that returns cluster properties corresponding to a single point. Reduce, a reduce function that merges properties of two clusters into one.