Earlier quoted context omitted.
A similar realization is that most algorithms/data structures problems posed in software engineering interviews are all about imposing the right mathematical formalisms. If you correctly infer the _structure_ of the problem, then you're going to have an easy time solving it. If not, you'll use a great lot of time hunting for a fruitful angle of attack.
Oh please let’s not glorify those simple trick questions to be anywhere near as hard or require the degree of intuition that OP or theoretical mathematicians work on. 75% of interview questions can be solved with some form of BFS/DFS and they’re largely a hazing ritual these days. I’m saying this as someone who recently got offers from 4 of the big 5 companies
I've heard students complain that graduate qualifying exams are a form of hazing for people hoping to become pure mathematicians, and although I don't entirely agree with that sentiment, they do play a similar role in weeding out people based on preparation rather than ability to generate deep, novel insights.