### nitesh.11911687's blog

By nitesh.11911687, history, 2 years ago,

Which is the Most Underrated Data Structure you know and reason for that.
This will help us to learn that and will help in future.

• +17

| Write comment?
 » 2 years ago, # |   +52 linked list for sure. Reason : don't know
•  » » 2 years ago, # ^ |   +7 it's not underrated, it's just useless.
•  » » » 2 years ago, # ^ |   +1 Everything has its uses, for example linked lists are quite nice for stuff like euler circles, and also linked list is very simple and cool to implement on your own
•  » » » » 2 years ago, # ^ |   +31 Just use treap like normal people
•  » » » » » 2 years ago, # ^ | ← Rev. 2 →   +4 >like normal people>said pupilbarbarian_clash_of_clans
•  » » » 2 years ago, # ^ |   +3 Then implement LRU cache without linked list in O(1) complexity
•  » » » » 2 weeks ago, # ^ |   0 Solutionis the time complexity the same as Linkedlist solution?
•  » » » 2 years ago, # ^ |   +8 While they are not super useful, I would definitely agree that they are underrated.One nice trick is to combine them with maps to iterators std::map::iterator>, in this way you can get benefits of both map and list. Example: 110657402 (although I don't understand this solution anymore so I am not sure whether that was really necessary).
•  » » » 2 years ago, # ^ |   -16 bfs with list is delicious list q = {0}; for(int v : q) for(int i : g[v]) if(d[i] == -1) { q.push(i); d[i] = d[v] + 1; } 
 » 2 years ago, # |   +137 A single integer
•  » » 2 years ago, # ^ |   +18 Top tier shitpost lol
 » 2 years ago, # |   +13 Umm..stack and deque. They can be pretty useful sometimes!
 » 2 years ago, # |   +22 set with custom comparator
 » 2 years ago, # |   +7 the rope. It does string operations in O(logN) time complexity and I think it can be very useful sometimes
•  » » 2 years ago, # ^ |   0 it's actually very useful, but sadly Splay Tree does almost everything it can do :(
•  » » » 2 years ago, # ^ |   0 its actually just a splay tree/rb tree/skip list/any dynamic O(logN) data structure with strings in fact
•  » » » » 2 years ago, # ^ |   +1 one advantage) rope can be used like this: Code#include #include //rope's in using namespace std; using namespace __gnu_cxx; int main(){ rope r; } 
 » 2 years ago, # |   0 unordered_map and reason is it cause TLE due to collision problems .
 » 2 years ago, # |   +11 I'd say maps but everyone uses maps xd
 » 2 years ago, # |   +4 STL std::list<..>, it's sometime useful when we need insertions and deletions in O(1).
 » 2 years ago, # |   +27 Cartesian tree
 » 2 years ago, # |   +17 bitset
•  » » 2 years ago, # ^ |   +20 Sadly ,Only remembered during Desperate times.
•  » » 2 years ago, # ^ |   +19
 » 2 years ago, # |   +11 Trie
 » 2 years ago, # |   0 Maps. They are the best