In teaching DS&A for Beyond Cracking the Coding Interview (beyondctci.com), it's hard to include truly original ideas. Most of the work is in refining the way things have already been taught.

Even when I do have original ideas, like the "negative binary search" from the previous post, they are usually too niche for people who are just trying to land a SWE role, so they don't belong in the book.

But I came up with a proof that heapify takes O(n) time that I like better than the classic one that is typically taught, and I might use it for the book - let me know what you think? https://lnkd.in/gTP8aQtq