# Solution Alignment The prompt asks for an implementation-level answer. The safest way to present it is to define the state, maintain clear invariants, then walk through complexity and tests. ## Problem Restatement In C++, explain: - The amortized and worst-case time complexity of vector::push_back, and how capacity growth/expansion is implemented (growth factor, reallocation steps, move vs. copy semantics, and iterator/reference invalidation rules). - How unordered_map is implemented under the hood: hashing function usage, bucket array layout, collision handling (e.g., chaining), load factor thresholds, rehashing strategy, iterator/reference invalidation, and expected time complexity guarantees for insert/find/erase. - The purpose of virtual functions, how dynamic dispatch works (vtables/vptr), associated runtime and memory costs, when virtual destructors are needed, and trade-offs versus alternatives... ## Recommended Approach Start with a brute-force baseline to confirm correctness, then identify the repeated work or ordering property that enables a better data structure such as a hash map, heap, stack, queue, two pointers, prefix sums, BFS/DFS, or dynamic programming. Write the implementation around a small invariant and test that invariant directly. ## Correctness The implementation should maintain an invariant after each loop or operation that directly matches the problem statement. At termination, that invariant implies the returned value has considered every valid candidate exactly once, or has preserved the required data-structure state after every API call. ## Complexity State the baseline complexity and the optimized complexity. For most interview constraints, justify why the optimized approach meets the expected input size. ## Edge Cases and Tests Empty and singleton inputs, duplicates, ties, invalid inputs, boundary values, and tests that exercise the main invariant.