Top Questions

1. What data structure can achieve random pop and push in better than O(n) time?
   3 votes

   1 answers
2. 2D segment tree update/modification step complexity
   3 votes

   1 answers
3. Why is std::priority_queue::emplace logarithmic?
   3 votes

   2 answers
4. Data structure to achieve random delete and insert where elements are weighted in [a,b]
   2 votes

   3 answers
5. Is there any advantage to moving a pointer?
   2 votes

   1 answers