A standard Introduction DSA course will generally not cover advanced DSA stuff like segment trees or Heavy-light decomposition, or theoretical stuff like number theory, or computational geometry all that stuff you would find in the competitive programming space.
> segment trees or Heavy-light decomposition, or theoretical stuff like number theory, or computational geometry
I am not sure if there are any problems on leetcode that require any of these, but based on a sample of a few of their contests, if they exist they are a very small fraction (<<50%) of all problems.
I do CP on various sites so I don't know if it's for Leetcode in particular. But some companies like Salesforce or DE Shaw or Codenation do include advanced problems on their tests.
Are there companies that ask a lot of leetcode bards in their interviews? That seems like overkill even for FAANGs though I can see why some groups might do so purely to filter by Math ability/interest.
I think I know more about interview questions then leet prep, but I find the remaining 50% is specific to the job but in the same vein as data structures and algorithms. So in game programming maybe it is a path finding problem or 3d math hit detection. In backend it’s an algorithm about network flow or caching. Still data structures, but more practical for the role!
What’s the other 50%? I’d have thought DS&A would cover everything.