I write an algoritm in C++ that uses
std::unrodered_map<char, int> data structure. There are only 30 types of characters that can be inserted and deleted from the map. But, those characters can be inserted and deleted many times (e.g. million times). Can I say that the space complexity is O(1) since only up to 30 types of characters can be inside the map?
Leave an answer