Technical Interviews: Difference between revisions

 
Line 32: Line 32:
* Union-Find
* Union-Find
* Heaps
* Heaps
* Using <code>std::set</code>, <code>std::map</code>, <code>std::priority_queue<code>
* Using <code>std::set</code>, <code>std::map</code>, <code>std::priority_queue</code>


;Graphs
;Graphs