Design Article System

Hash Map + Sorted Map for Ranking, Deque for Recent Flips The core challenge is maintaining article scores dynamically while also answering two distinct queries efficiently: top-K by score (with tie-breaking by article ID) and the most recent three vote flips per user. Doing a full sort on every query would be prohibitively slow under the given constraints (up to 10^5 articles, 10^6 votes). Instead, we can use a combination of data structures that each handle their specific…