|
|
|
|
|
by selfhifive
1502 days ago
|
|
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. |
|
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.
The vast majority require:
- no DS&A knowledge whatsoever
- basic techniques (recursion, simple graph/tree algos, binary search, simple dynamic programming)