Bug Report for https://neetcode.io/problems/time-based-key-value-store Wrong complexity estimation for solution "2. Binary Search" in C++. If we use std::map, complexity of set() method is a sum of: 1. O(1) for search in std::unordered_map 2. O(Log M) for insertion to std::map Description of solution says "O(1) for set()"