I cannot recall the DSA questions but they were standard LC medium type. Given a really long list of docs. Docs contains string which are separated by spaces. Also, we are given a list of queries. Each query has word1, word2, distance. So for each query find the list of documents where word1 and word2 are present with less than 'distance' number of words present between word1 and word2. Find most optimal algo for this problem. HLD: Design a document platform doc which can be accessed by service engineering team or end users for documentations. High avalibility not critical, immediate consistency not required, but easy to fetch and edit the docs, should be very cost effective and should scale during peak time(say docs are accessed heavily just after a product release). HM round: Design a service which replicates data received from upstream services and then forwards it to other microservices consuming the data.
