I'm not sure I understand the comparison. CS interview problems are interesting, well-constrained math riddles with endless variety. As far as I can tell, they're nearly the opposite of menial drudgery.
I don't think they're great for interviewing, on account of how they don't resemble what programmers actually do, but I do think they're a heck of a lot more fun than menial labor, especially when job offers aren't riding on it.
The CS interview problems that are asked are a very specific view of CS that not everybody finds interesting or works on. There is a lot more variety to CS and software engineering than string and graph algorithms, which is all I've ever been asked at Google (where is numerical optimization, statistics beyond basic counting, all of graphics, etc). I also never get asked anything with regards to actually engineering software by them, whereas I have been asked that at Apple for example.
You'd be shocked how many people plan to crack the coding interview by memorizing every problem on leetcode letter for letter without ever trying to solve one without looking up the answer.
