banquet-company
Algorithm for a company dedicated to offering banquets
Algorithm for a company dedicated to offering banquets
Algorithms and data-structures implemented on JavaScript
Calculate fast and secure 32-byte hash strings with JavaScript.
js-datastructures-ko
A simple paging algorithm for Node.js, JavaScript and TypeScript.
Create repeated text patterns with a fast and unique string concatenating algorithm.
Develop entity by evolution algorithm
Simple encryption and decryption functionality using the AES-256-CBC algorithm
Random-data generating algorithm for experimental, depth-based Quake III Arena Machinima purposes.
A simple binary search implementation.
Fastest Levenshtein distance implementation in JS.
Word compare gives you the most closely related words to an input string. If you have a list of strings, word compare can give you the most closely related list elements to a string input.
🤠 Parser for object property paths with wildcards and regexps 🌵
🤠 Object property paths with wildcards and regexps 🌵
🤠 Functional utilities using object property paths with wildcards and regexps 🌵
The best library for tables and lists.
A simple searching algorithm
Minimize Cash Flow among a given set of friends who have borrowed money from each other. Given a number of friends who have to give or take some amount of money from one another. Design an algorithm by which the total cash flow among all the friends is mi