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.
