unordered_map offers average O(1) time for insert, find, and erase ,it can still cause Time Limit Exceeded (TLE)

1. Worst-Case Complexity is O(n)

Hash collisions can degrade performance from O(1) to O(n), especially with poor key distribution.

Use map (O(log n)) for consistent performance.

Add your knowlesge ..