Medium

10. std::unordered_map & Fast Lookups

Problem Objective

Solve Two Sum in C++ using std::unordered_map<int, int> to find pair indices matching target.

Expected Terminal OutputStandard Out

Indices: 0 and 1

[✓] Unordered map verified (Time: 0.008s, Memory: 2.3 MB)

Execution Constraints

Implementation Checklist

Declare unordered_mapCheck if complement exists with .find()Return pair indices

main.cppg++ -std=c++20 -O2

Loading Bytes Space Editor...