This is a super cool problem. It started as a modified version of the following two problems:
Binary search is one of the most fundamental algorithms in computer science, and often one of the earliest taught algorithms in University (depending on major, of course). Alone, binary search lets us quickly determine the index of some value in a sorted dataset. If the value doesn’t exist, ideally it will return some sentinel value indicative of that. So in short:
MutationObserver is a DOM API that allows us to react to changes in the DOM in a
performant way. The
function which gets called on each mutation you choose to observe. The callback is
called with two parameters.
The browser cache is something I think a lot of developers know of but don’t understand well, primarily because many tools take care of it for us. For example, when building an application with Node.js the first thing many developers do is type: