I am trying to estimate the complexity of the Problemset Filter feature in Codeforces. I have also thought about indexing by tags. Then the complexity would be k log N

(N: number of problems, k: number of tags).

Correct me if I am wrong. I would appreciate your feedback.