Rectpack-ts is a TypeScript library that implements heuristic algorithms for solving the 2D knapsack problem, also known as the bin packing problem. This involves packing a set of rectangles into the smallest number of bins.
Knapsack problem algorithms for JavaScript
bin-re-packing algorithms
The Fastest and Smallest Subset finder. Finds all subsets from an array that equal a target number. In O(N log N) time and 2N+2 Space.
Knapsack problem algorithms for JavaScript
The Fastest and Smallest Subset finder. Finds all subsets from an array that equal a target number. In O(N log N) time and 2N+2 Space.
Automatically provisions and installs locally-trusted TLS certificates for Node.js https servers (including Express.js, etc.) using mkcert.
Knapsack Pro Vitest splits Vitest tests across CI nodes and makes sure that tests will run in optimal time on each CI node.