Curious if people see these things… I’ve personally seen high dimensional DP that are not on LC that were really hard, but I’ve yet to see anything as hardcore as these contrived data structures. If I got one of these I’d be mad.
I once got Hard segment tree question in an OA.
I got segment trees in Google onsite. Needless to say I failed
I got a segment tree question (max query with point updates) for an intern role at Amazon India. The interviewer didn’t ask to implement the segment tree however, she just asked questions about the tree, time complexity etc. and asked to use it as an interface to solve the actual problem
I got one which reduced to segment trees in one of the slightly hardish rounds at Indeed.
I got combinatorial DP in Google
I got a balanced bst (not implementation, just augmentation idea and usage) as a follow up in Google.
Got a segtree with lazy tag problem from Google last year.
As a follow-up, don’t need to fully implement segtree.
Just got asked a question best solved by using a segment tree at google on-site
Prim’s is much less annoying than these other two
Following