Design Twitter

Problem Id: 355 Difficulty: Medium


This is a system design problem, not an algorithm one.


from collections import defaultdict
class Twitter:

    def __init__(self):
        Initialize your data structure here.
        self.tweets = defaultdict(list)
        self.following = defaultdict(list)
        self.timestamp = 0

    def postTweet(self, userId: int, tweetId: int) -> None:
        Compose a new tweet.
        self.tweets[userId].append((tweetId, self.timestamp))
        if len(self.tweets[userId]) > 10:
        self.timestamp += 1

    def getNewsFeed(self, userId: int) -> List[int]:
        Retrieve the 10 most recent tweet ids in the user's news feed. Each item in the news feed must be posted by users who the user followed or by the user herself. Tweets must be ordered from most recent to least recent.
        posts = self.tweets[userId][:]
        for following in self.following[userId]:
        posts.sort(key=lambda x: x[1])
        return [p[0] for p in posts[-10:]][::-1]

    def follow(self, followerId: int, followeeId: int) -> None:
        Follower follows a followee. If the operation is invalid, it should be a no-op.
        if followerId != followeeId and followeeId not in self.following[followerId]:

    def unfollow(self, followerId: int, followeeId: int) -> None:
        Follower unfollows a followee. If the operation is invalid, it should be a no-op.
        if followeeId in self.following[followerId]:

# Your Twitter object will be instantiated and called as such:
# obj = Twitter()
# obj.postTweet(userId,tweetId)
# param_2 = obj.getNewsFeed(userId)
# obj.follow(followerId,followeeId)
# obj.unfollow(followerId,followeeId)