Coursera's Data Structures and Algorithms Specialization

Disjoint-set forests for ES6

📚Everything you will EVER need to survive Data Structures, in C++. In collaboration with @PreethiSamanthaBennet✨

High performance set theory - functional utilities which operate on arbitrary input sets.

An ESnext spec-compliant `Set.prototype.isDisjointFrom` shim/polyfill/replacement that works as far down as ES3

Build a list of high-scoring, non-overlapping intervals using sampling or scheduling methods

A disjoint-set data structure stores a collection of disjoint (non-overlapping) sets.