[pmiller2]

Writing down binary searches and reversing linked lists is one thing, but what people are talking about here are questions of the nature "write down this algorithm that was publication-worthy 30 years ago," or, what I like to call "stupid programmer tricks." Those would include "implement rand10() using rand7()," or "find the closest palindrome to a given integer n."

[JustSomeNobody]

I absolutely should be tested on when to use a dictionary vs an array vs a tree. But if finding the "acceptable" solution to a problem relies on remembering one particular algorithm from college that I've not had to use in a dozen years, as some LC problems do, then that's reducing a senior level dev interview down to a junior level dev interview. As it stands, all senior level devs have to do a month of Leet Code just to be competitive. The people down voting me can't honestly say they remember every single one of the algorithms that are popular on LC without studying. That's just not being honest.