1
Q
vector access
A
O(1)
2
Q
vector search
A
O(n)
3
Q
vector insertion
A
end: O(1)
middle/front: O(n)
4
Q
vector deletion
A
end: O(1)
middle/front: O(n)
5
Q
stack access
A
top: O(1)
6
Q
stack search
A
manual traversal: O(n)
7
Q
stack insertion
A
push: O(1)
8
Q
stack deletion
A
pop: O(1)
9
Q
queue access
A
front/back: O(1)
10
Q
queue search
A
manual traversal: O(n)
11
Q
queue insertion
A
push: O(1)
12
Q
queue deletion
A
pop: O(1)
13
Q
priority_queue access
A
top: O(1)
14
Q
priority_queue search
A
manual traversal: O(n)
15
Q
priority_queue insertion
A
push: O(log n)
16
Q
priority_queue deletion
A
pop: O(log n)
17
Q
deque access
A
O(1)
18
Q
deque search
A
O(n)
19
Q
deque insertion
A
front/back: O(1)
middle: O(n)
20
Q
deque deletion
A
front/back: O(1)
middle: O(n)
21
Q
list access
A
O(n)
22
Q
list deletion
A
given iterator: O(1)
22
Q
list search
A
O(n)
23
Q
list insertion
A
given iterator: O(1)
24
unordered_map access
NA key-based
25
unordered_map search
avg: O(1)
worst: O(n)
25
unordered_map insertion
avg: O(1)
26
unordered_map deletion
avg: O(1)
27
unordered_set access
NA key-based
28
unordered_set search
avg: O(1)
worst: O(n)
29
unordered_set insertion
avg: O(1)
30
unordered_set deletion
avg: O(1)
31
map search
O(log n)
31
map access
NA key-based
32
map deletion
O(log n)
32
map insertion
O(log n)
32
set access
NA key-based
33
set search
O(log n)
34
set insertion
O(log n)
35
set deletion
O(log n)
C++ Practice
flashcards
Decks in class (12)
# Cards
-
C++ Core Concepts35
-
Data Structures & STL22
-
Memory & Performance15
-
Latency & Throughput7
-
Concurrency & Multithreading19
-
System Design & Architecture20
-
Reliability & Failure Handling6
-
Debugging, Profiling, Monitoring12
-
Leet Code Triggers12
-
Big O Complexity40
-
Common C++ Code97
-
Technical Questions112
