Role - Java Backend Developer
Experience - 3 years 10 months
Location - Bangalore

Round 1 - Problem Solving Round

• 2 arrays are given, each of which consists of sorted and disjoint intervals. Print the intervals which are common to both the arrays. For example - Array A - [1,5], [7,9] [9, 11] and Array B - [0, 4], [4,10], [11,13]. This should return - [1,4], [7,9], [9,10], [11,11].
• https://leetcode.com/problems/search-in-rotated-sorted-array/
  Verdict - Strong Positive

Round 2 - LLD Round

• Discuss the basic working of kafka and various components.
• How will you debug if a produces publishes messages but a consumer is not able to consume them?
• In a payment system, if re-tries occur, how will you ensure the same payment request does not deduct balance multiple times?
• Discuss LLD of Food delivery system - functional and non-functional requirements, entities, schema design and various follow up questions.
• In which tables will you introduce indexing and sharding?
  Interview wasn't probably satisfied with my proposed design and trade-offs
  Verdict - Negative.

Overall - Rejected as each round was eliminatory.