Is it required to know the implementaion of data structures for competitive programming?

I’m a beginner and currently learning data structures, i wanted to know if i should learn to implement data structures from scratch or is it enough to just have a sound knowledge about them, as in competitive programming most people would use C++ STL or something.

So you use STL to implement segment tree? :thinking::thinking::thinking:

1 Like

STL only has few data struc like stack,queue,set, map, pair etc
but you will need lot more like solving probs
you dont need to implement whats already there

1 Like

I have no idea what that is, but i get your point :laughing:

No bullshit, straight to the point answer:-
1)Learn stl of map,its variations,pairs,queues, stacks,adjacency lists, vectors,etc.
2)Learn the actual ds for trees,segment trees,link-cut trees, persistent trees, graphs,merge-sort tree,etc.


Thanks, this helps so much :smile:

Yup, I believe in sticking to point and not just beating around the bush :stuck_out_tongue:

1 Like

I don’t think it’s necessary to learn link-cut tree.

1 Like

Where did I say that it is necessary to learn link-cut trees ?

1 Like

If you are moving from C to C++. Then it is all waste until you don’t use STL of C++ and geeksforgeeks is there when you need.