Do companies still ask Bitwise, DP, and niche tree/graph questions for roles that don't use them?
I have yet to see a bitwise / bit manipulation, DP, or obscure tree/graph algorithm in my interview experience. And yet the general advice is to make sure you have all of those covered before interviewing. I have NOT interviewed at FB/G yet though. Obscure Tree/graph includes: AVL Tree, Red-Black Tree, MST, Union Find, Kruskal/Prim, etc. I am not interviewing for traditional web, backend, distributed, low-level roles, so that may be why my questions seem to be somewhat easier (only medium / medium-hard, with occasional Hard graph problem that only requires DFS/BFS/TopoSort) For poll: please only select ones you have seen in interviews:
Yes
All of these can still be asked
The team I work on holds in memory Trie. Also for lots of the calculations we use bitwise operation. Never used DP though.
Which team are you on if you don’t mind? I also think I should be sharp at Trie
I was asked to implement a Trie, had a DP hard, and a graph search with backtracking questions at times.
+1 encountered all of these. Trie with backtracking in 40 mins. Did it without bugs. Rejected. Don’t know wtf they wanted. But this tells me enough about the place and they’re usually toxic. A good team may ask difficult question but will work with you in solving it as if you’re a team. And will be reasonable about what’s achievable.
Maybe wanted better explanation of thought process. Or they just had another candidate. Or toxic as you said.
Nope I haven't encountered with those problems except the difficult DP problems. I feel like some people like to ask those because they like to feel superior. I would never ask those types of questions.